| 2026 | PKC | Separating Selective Opening Security from Standard Security, Assuming Indistinguishability Obfuscation. | Justin Holmgren, Brent Waters |
| 2022 | CRYPTO | Nearly Optimal Property Preserving Hashing. | Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs |
| 2022 | CRYPTO | Faster Sounder Succinct Arguments and sfIOPs. | Justin Holmgren, Ron D. Rothblum |
| 2022 | ICALP | Delegation for Search Problems. | Justin Holmgren, Andrea Lincoln, Ron D. Rothblum |
| 2022 | STOC | Parallel repetition for all 3-player games over binary alphabet. | Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan |
| 2022 | TCC | 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 |
| 2021 | CRYPTO | Time- and Space-Efficient Arguments from Groups of Unknown Order. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2021 | STOC | Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). | Justin Holmgren, Alex Lombardi, Ron D. Rothblum |
| 2020 | TCC | Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2020 | TCC | Transparent Error Correcting in a Computationally Bounded World. | Ofer Grossman, Justin Holmgren, Eylon Yogev |
| 2019 | CRYPTO | On the Plausibility of Fully Homomorphic Encryption for RAMs. | Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs |
| 2019 | STOC | Fiat-Shamir: from practice to theory. | Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs |
| 2019 | STOC | The parallel repetition of non-signaling games: counterexamples and dichotomy. | Justin Holmgren, Lisa Yang |
| 2019 | TCC | On the (In)security of Kilian-Based SNARGs. | James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum |
| 2019 | TCC | Permuted Puzzles and Cryptographic Hardness. | Elette Boyle, Justin Holmgren, Mor Weiss |
| 2018 | FOCS | Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). | Justin Holmgren, Alex Lombardi |
| 2018 | FOCS | Delegating Computations with (Almost) Minimal Time and Space Overhead. | Justin Holmgren, Ron Rothblum |
| 2017 | STOC | Non-interactive delegation and batch NP verification from standard computational assumptions. | Zvika Brakerski, Justin Holmgren, Yael Tauman Kalai |
| 2017 | TCC | Towards Doubly Efficient Private Information Retrieval. | Ran Canetti, Justin Holmgren, Silas Richelson |
| 2016 | STOC | Watermarking cryptographic capabilities. | Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs |
| 2016 | TCC | Adaptive Succinct Garbled RAM or: How to Delegate Your Database. | Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova |
| 2015 | ICALP | Multilinear Pseudorandom Functions. | Aloni Cohen, Justin Holmgren |
| 2015 | STOC | Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. | Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan |