Justin Holmgren
Justin Holmgren
Simons Institute
Verified email at mit.edu
Cited by
Cited by
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
Watermarking cryptographic capabilities
A Cohen, J Holmgren, R Nishimaki, V Vaikuntanathan, D Wichs
SIAM Journal on Computing 47 (6), 2157-2202, 2018
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
Fully succinct garbled RAM
R Canetti, J Holmgren
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
Automated color selection using semantic knowledge
C Havasi, R Speer, J Holmgren
2010 AAAI Fall Symposium Series, 2010
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
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
Succinct Adaptive Garbled RAM.
R Canetti, Y Chen, J Holmgren, M Raykova
IACR Cryptol. ePrint Arch. 2015, 1074, 2015
Fiat-Shamir From Simpler Assumptions.
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum
IACR Cryptol. ePrint Arch. 2018, 1004, 2018
Towards doubly efficient private information retrieval
R Canetti, J Holmgren, S Richelson
Theory of Cryptography Conference, 694-726, 2017
PK Holmgren
NH, and Barnett, LC, 1990
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
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
Counterexamples to the low-degree conjecture
J Holmgren, AS Wein
arXiv preprint arXiv:2004.08454, 2020
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
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
On Round-By-Round Soundness and State Restoration Attacks.
J Holmgren
IACR Cryptol. ePrint Arch. 2019, 1261, 2019
Multilinear pseudorandom functions
A Cohen, J Holmgren
International Colloquium on Automata, Languages, and Programming, 331-342, 2015
On the plausibility of fully homomorphic encryption for RAMs
A Hamlin, J Holmgren, M Weiss, D Wichs
Annual International Cryptology Conference, 589-619, 2019
Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem.
J Holmgren, L Yang
Electronic Colloquium on Computational Complexity (ECCC) 25, 121, 2018
The system can't perform the operation now. Try again later.
Articles 1–20