Automated Color Selection Using Semantic Knowledge. - Catherine Havasi; Robyn Speer; Justin Holmgren (AAAI Fall Symposium: Commonsense Knowledge, 2010)

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs. - Ran Canetti; Justin Holmgren; Abhishek Jain 002; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2014)

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. - Ran Canetti; Justin Holmgren; Abhishek Jain 002; Vinod Vaikuntanathan (STOC, 2015)

Succinct Adaptive Garbled RAM. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2015)

Fully Succinct Garbled RAM. - Ran Canetti; Justin Holmgren (IACR Cryptol. ePrint Arch., 2015)

Multilinear Pseudorandom Functions. - Aloni Cohen; Justin Holmgren (IACR Cryptol. ePrint Arch., 2015)

Publicly Verifiable Software Watermarking. - Aloni Cohen; Justin Holmgren; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2015)

On Necessary Padding with IO. - Justin Holmgren (IACR Cryptol. ePrint Arch., 2015)

Adaptive Succinct Garbled RAM or: How to Delegate Your Database. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Mariana Raykova 001 (TCC (B2), 2016)

Non-Interactive RAM and Batch NP Delegation from any PIR. - Zvika Brakerski; Justin Holmgren; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2016)

Non-interactive delegation and batch NP verification from standard computational assumptions. - Zvika Brakerski; Justin Holmgren; Yael Tauman Kalai (STOC, 2017)

(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games. - Justin Holmgren; Lisa Yang 001 (Electron. Colloquium Comput. Complex., 2017)

Towards Doubly Efficient Private Information Retrieval. - Ran Canetti; Justin Holmgren; Silas Richelson (IACR Cryptol. ePrint Arch., 2017)

Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). - Justin Holmgren; Alex Lombardi (FOCS, 2018)

Delegating Computations with (almost) Minimal Time and Space Overhead. - Justin Holmgren; Ron Rothblum (Electron. Colloquium Comput. Complex., 2018)

Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem. - Justin Holmgren; Lisa Yang 001 (Electron. Colloquium Comput. Complex., 2018)

Fiat-Shamir From Simpler Assumptions. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

Cryptographic Hashing From Strong One-Way Functions. - Justin Holmgren; Alex Lombardi (IACR Cryptol. ePrint Arch., 2018)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. - Nir Bitansky; Ran Canetti; Sanjam Garg; Justin Holmgren; Abhishek Jain 002; Huijia Lin; Rafael Pass; Sidharth Telang; Vinod Vaikuntanathan (SIAM J. Comput., 2018)

Watermarking Cryptographic Capabilities. - Aloni Cohen; Justin Holmgren; Ryo Nishimaki; Vinod Vaikuntanathan; Daniel Wichs (SIAM J. Comput., 2018)

Secure computation on untrusted platforms. - Justin Lee Holmgren (2018)

Fiat-Shamir: from practice to theory. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum; Daniel Wichs (STOC, 2019)

The parallel repetition of non-signaling games: counterexamples and dichotomy. - Justin Holmgren; Lisa Yang 001 (STOC, 2019)

On the (In)security of Kilian-Based SNARGs. - James Bartusek; Liron Bronfman; Justin Holmgren; Fermi Ma; Ron Rothblum (IACR Cryptol. ePrint Arch., 2019)

Permuted Puzzles and Cryptographic Hardness. - Elette Boyle; Justin Holmgren; Mor Weiss (IACR Cryptol. ePrint Arch., 2019)

On the Plausibility of Fully Homomorphic Encryption for RAMs. - Ariel Hamlin; Justin Holmgren; Mor Weiss; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

On Round-By-Round Soundness and State Restoration Attacks. - Justin Holmgren (IACR Cryptol. ePrint Arch., 2019)

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? - Marshall Ball; Justin Holmgren; Yuval Ishai; Tianren Liu; Tal Malkin (ITCS, 2020)

Error Correcting Codes for Uncompressed Messages. - Ofer Grossman; Justin Holmgren (Electron. Colloquium Comput. Complex., 2020)

No-Signaling MIPs and Faster-Than-Light Communication, Revisited. - Justin Holmgren (Electron. Colloquium Comput. Complex., 2020)

A Parallel Repetition Theorem for the GHZ Game. - Justin Holmgren; Ran Raz (Electron. Colloquium Comput. Complex., 2020)

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2020)

Transparent Error Correcting in a Computationally Bounded World. - Ofer Grossman; Justin Holmgren; Eylon Yogev (IACR Cryptol. ePrint Arch., 2020)

Parallel Repetition for the GHZ Game: A Simpler Proof. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (APPROX-RANDOM, 2021)

Counterexamples to the Low-Degree Conjecture. - Justin Holmgren; Alexander S. Wein (ITCS, 2021)

A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2021)

Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). - Justin Holmgren; Alex Lombardi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2021)

Time- and Space-Efficient Arguments from Groups of Unknown Order. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2021)

On the Security of Doubly Efficient PIR. - Elette Boyle; Justin Holmgren; Fermi Ma; Mor Weiss (IACR Cryptol. ePrint Arch., 2021)

Faster Sounder Succinct Arguments and sfIOPs. - Justin Holmgren; Ron D. Rothblum (CRYPTO (1), 2022)

Delegation for Search Problems. - Justin Holmgren; Andrea Lincoln; Ron D. Rothblum (ICALP, 2022)

Parallel Repetition For All 3-Player Games Over Binary Alphabet. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2022)

PPAD is as Hard as LWE and Iterated Squaring. - Nir Bitansky; Arka Rai Choudhuri; Justin Holmgren; Chethan Kamath; Alex Lombardi; Omer Paneth; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2022)

Nearly Optimal Property Preserving Hashing. - Justin Holmgren; Minghao Liu 010; LaKyah Tyner; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Faster Sounder Succinct Arguments and IOPs. - Justin Holmgren; Ron Rothblum (IACR Cryptol. ePrint Arch., 2022)

Linear-Size Boolean Circuits for Multiselection. - Justin Holmgren; Ron Rothblum (Electron. Colloquium Comput. Complex., 2023)

Locally Covert Learning. - Justin Holmgren; Ruta Jawale (IACR Cryptol. ePrint Arch., 2023)

Separating Selective Opening Security From Standard Security, Assuming IO. - Justin Holmgren; Brent Waters (IACR Cryptol. ePrint Arch., 2024)