| 2026 | STOC | SNARGs for NP and Non-signaling PCPs, Revisited. | Lalita Devadas, Samuel B. Hopkins, Yael Tauman Kalai, Pravesh K. Kothari, Alex Lombardi, Surya Mathialagan |
| 2025 | FOCS | Cryptography Meets Worst-case Complexity: Optimal Security and More From iO and Worst-case Assumptions. | Rahul Ilango, Alex Lombardi |
| 2025 | STOC | Universal SNARGs for NP from Proofs of Correctness. | Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan |
| 2024 | STOC | SNARGs under LWE via Propositional Proofs. | Zhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan |
| 2024 | STOC | A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography. | Alex Lombardi, Fermi Ma, John Wright |
| 2023 | CRYPTO | SNARGs for Monotone Policy Batch NP. | Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth |
| 2023 | EuroCrypt | SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. | Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan |
| 2023 | STOC | Quantum Advantage from Any Non-local Game. | Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang |
| 2023 | STOC | Boosting Batch Arguments and RAM Delegation. | Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs |
| 2022 | CRYPTO | Succinct Classical Verification of Quantum Computation. | James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang |
| 2022 | FOCS | Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably. | Alex Lombardi, Fermi Ma, Nicholas Spooner |
| 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 |
| 2022 | TCC | Post-quantum Insecurity from LWE. | Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs |
| 2021 | CRYPTO | Does Fiat-Shamir Require a Cryptographic Hash Function? | Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach |
| 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 | CRYPTO | Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. | Alex Lombardi, Vinod Vaikuntanathan |
| 2020 | EuroCrypt | Statistical ZAPR Arguments from Bilinear Maps. | Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs |
| 2019 | CRYPTO | New Constructions of Reusable Designated-Verifier NIZKs. | Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu |
| 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 | TCC | Lattice Trapdoors and IBE from Middle-Product LWE. | Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong |
| 2018 | EuroCrypt | Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. | Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan |
| 2018 | FOCS | Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). | Justin Holmgren, Alex Lombardi |
| 2018 | TCC | Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm. | Prabhanjan Ananth, Alex Lombardi |
| 2017 | TCC | Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. | Alex Lombardi, Vinod Vaikuntanathan |