Follow
Justin Holmgren
Justin Holmgren
Simons Institute
Verified email at mit.edu
Title
Cited by
Cited by
Year
Succinct garbling and indistinguishability obfuscation for RAM programs
R Canetti, J Holmgren, A Jain, V Vaikuntanathan
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
114*2015
Fiat-Shamir: from practice to theory
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
1092019
Watermarking cryptographic capabilities
A Cohen, J Holmgren, R Nishimaki, V Vaikuntanathan, D Wichs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
105*2016
Cryptographic hashing from strong one-way functions (or: One-way product functions and their applications)
J Holmgren, A Lombardi
2018 IEEE 59th annual symposium on Foundations of Computer Science (FOCS …, 2018
582018
Fully succinct garbled RAM
R Canetti, J Holmgren
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
562016
Automated color selection using semantic knowledge
C Havasi, R Speer, J Holmgren
2010 AAAI Fall Symposium Series, 2010
512010
Non-interactive delegation and batch NP verification from standard computational assumptions
Z Brakerski, J Holmgren, Y Kalai
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
47*2017
Succinct adaptive garbled RAM
R Canetti, Y Chen, J Holmgren, M Raykova
Cryptology ePrint Archive, 2015
44*2015
Fiat-Shamir from simpler assumptions
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum
Cryptology ePrint Archive, 2018
422018
Towards doubly efficient private information retrieval
R Canetti, J Holmgren, S Richelson
Theory of Cryptography Conference, 694-726, 2017
402017
Delegating computations with (almost) minimal time and space overhead
J Holmgren, R Rothblum
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
202018
Time-and space-efficient arguments from groups of unknown order
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Annual International Cryptology Conference, 123-152, 2021
192021
Indistinguishability obfuscation for RAM programs and succinct randomized encodings
N Bitansky, R Canetti, S Garg, J Holmgren, A Jain, H Lin, R Pass, ...
SIAM Journal on Computing 47 (3), 1123-1210, 2018
162018
On the (in) security of Kilian-based SNARGs
J Bartusek, L Bronfman, J Holmgren, F Ma, RD Rothblum
Theory of Cryptography Conference, 522-551, 2019
122019
Counterexamples to the low-degree conjecture
J Holmgren, AS Wein
arXiv preprint arXiv:2004.08454, 2020
112020
On the complexity of decomposable randomized encodings, or: how friendly can a garbling-friendly PRF be?
M Ball, J Holmgren, Y Ishai, T Liu, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
112020
The parallel repetition of non-signaling games: counterexamples and dichotomy
J Holmgren, L Yang
112019
Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
J Holmgren, A Lombardi, RD Rothblum
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
102021
Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Theory of Cryptography Conference, 168-197, 2020
72020
Permuted puzzles and cryptographic hardness
E Boyle, J Holmgren, M Weiss
Theory of Cryptography Conference, 465-493, 2019
62019
The system can't perform the operation now. Try again later.
Articles 1–20