| 2026 | CRYPTO | TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes. | Benedikt Bnz, Giacomo Fenzi, Ron D. Rothblum, William Wang |
| 2026 | CRYPTO | Succinct Zero-Knowledge Proofs from One-Way Functions: The Blackbox Way. | Eden Florentz-Konopnicki, Ron D. Rothblum |
| 2026 | CRYPTO | Bolt: Faster SNARKs from Sketched Codes. | Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum |
| 2026 | EuroCrypt | Jagged Polynomial Commitments (or: How to Stack Multilinears). | Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh, Ron D. Rothblum |
| 2025 | CRYPTO | How to Prove False Statements: Practical Attacks on Fiat-Shamir. | Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov |
| 2025 | EuroCrypt | Blaze: Fast SNARKs from Interleaved RAA Codes. | Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger |
| 2025 | STOC | Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2025 | TCC | Linear Prover IOPs in Log Star Rounds. | Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum |
| 2024 | EuroCrypt | Strong Batching for Non-interactive Statistical Zero-Knowledge. | Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2024 | FOCS | Dot-Product Proofs and Their Applications. | Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu |
| 2024 | STOC | Batch Proofs Are Statistically Hiding. | Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2024 | TCC | Rate-1 Zero-Knowledge Proofs from One-Way Functions. | Noor Athamnah, Eden Florentz-Konopnicki, Ron D. Rothblum |
| 2024 | TCC | Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. | Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2023 | TCC | Combinatorially Homomorphic Encryption. | Yuval Ishai, Eyal Kushnir, Ron D. Rothblum |
| 2022 | CRYPTO | Faster Sounder Succinct Arguments and sfIOPs. | Justin Holmgren, Ron D. Rothblum |
| 2022 | CRYPTO | Succinct Interactive Oracle Proofs: Applications and Limitations. | Shafik Nassar, Ron D. Rothblum |
| 2022 | CRYPTO | Collision-Resistance from Multi-Collision-Resistance. | Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2022 | FOCS | Unstructured Hardness to Average-Case Randomness. | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2022 | ICALP | Delegation for Search Problems. | Justin Holmgren, Andrea Lincoln, Ron D. Rothblum |
| 2022 | STOC | Proving as fast as computing: succinct arguments with constant prover overhead. | Noga Ron-Zewi, Ron D. Rothblum |
| 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 | EuroCrypt | Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers. | Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 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 | FOCS | On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. | Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev |
| 2020 | FOCS | Local Proofs Approaching the Witness Length [Extended Abstract]. | Noga Ron-Zewi, 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 | Batch Verification for Statistical Zero Knowledge Proofs. | Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan |
| 2020 | TCC | Batch Verification and Proofs of Proximity with Polylog Overhead. | Guy N. Rothblum, Ron D. Rothblum |
| 2019 | CRYPTO | New Constructions of Reusable Designated-Verifier NIZKs. | Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu |
| 2019 | EuroCrypt | Reusable Designated-Verifier NIZKs for all NP from CDH. | Willy Quach, Ron D. Rothblum, Daniel Wichs |
| 2019 | PKC | Towards Non-Interactive Zero-Knowledge for NP from LWE. | Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki |
| 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 | On the (In)security of Kilian-Based SNARGs. | James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum |
| 2019 | TCC | Statistical Difference Beyond the Polarizing Regime. | Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2018 | CRYPTO | From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. | Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2018 | EuroCrypt | Multi-Collision Resistant Hash Functions and Their Applications. | Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2018 | EuroCrypt | Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. | Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum |
| 2018 | ICALP | An Exponential Separation Between MA and AM Proofs of Proximity. | Tom Gur, Yang P. Liu, Ron D. Rothblum |
| 2017 | CRYPTO | From Obfuscation to the Security of Fiat-Shamir for Proofs. | Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum |
| 2016 | CRYPTO | Spooky Encryption and Its Applications. | Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs |
| 2016 | STOC | Constant-round interactive proofs for delegating computation. | Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2015 | CRYPTO | Arguments of Proximity - [Extended Abstract]. | Yael Tauman Kalai, Ron D. Rothblum |
| 2015 | ICALP | Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). | Oded Goldreich, Tom Gur, Ron D. Rothblum |
| 2014 | ICALP | Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). | Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2014 | ICALP | Pseudorandom Graphs in Data Structures. | Omer Reingold, Ron D. Rothblum, Udi Wieder |
| 2014 | STOC | How to delegate computations: the power of no-signaling proofs. | Yael Tauman Kalai, Ran Raz, Ron D. Rothblum |
| 2013 | CRYPTO | Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). | Gil Cohen, Ivan Bjerre Damgrd, Yuval Ishai, Jonas Klker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum |
| 2013 | STOC | Delegation for bounded space. | Yael Tauman Kalai, Ran Raz, Ron D. Rothblum |