| 2025 | FOCS | Proving Natural Distribution Properties is Harder than Testing Them. | Tal Herman, Guy N. Rothblum |
| 2025 | ICLR | How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions. | Tal Herman, Guy N. Rothblum |
| 2025 | ICML | Local Pan-privacy for Federated Analytics. | Vitaly Feldman, Audra McMillan, Guy N. Rothblum, Kunal Talwar |
| 2024 | CCS | Samplable Anonymous Aggregation for Private Federated Data Analysis. | Kunal Talwar, Shan Wang, Audra McMillan, Vitaly Feldman, Pansy Bansal, Bailey Basile, ine Cahill, Yi Sheng Chan, Mike Chatzidakis, Junye Chen, Oliver R. A. Chick, Mona Chitnis, Suman Ganta, Yusuf Goren, Filip Granqvist, Kristine Guo, Frederic Jacobs, Omid Javidbakht, Albert Liu, Richard Low, Dan Mascenik, Steve Myers, David Park, Wonhee Park, Gianni Parsa, Tommy Pauly, Christian Priebe, Rehan Rishi, Guy N. Rothblum, Congzheng Song, Linmao Song, Karl Tarbe, Sebastian Vogt, Shundong Zhou, Vojta Jina, Michael Scaria, Luke Winstrom |
| 2024 | COLT | On Computationally Efficient Multi-Class Calibration. | Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum |
| 2024 | CRYPTO | Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. | Noga Amit, Guy N. Rothblum |
| 2024 | FOCS | Interactive Proofs for General Distribution Properties. | Tal Herman, Guy N. Rothblum |
| 2023 | EuroCrypt | Indistinguishable Predictions and Multi-group Fair Learning. | Guy N. Rothblum |
| 2023 | FOCS | Doubley-Efficient Interactive Proofs for Distribution Properties. | Tal Herman, Guy N. Rothblum |
| 2023 | STOC | Constant-Round Arguments from One-Way Functions. | Noga Amit, Guy N. Rothblum |
| 2022 | ALT | Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 2022 | STOC | Verifying the unseen: interactive proofs for label-invariant distribution properties. | Tal Herman, Guy N. Rothblum |
| 2021 | ICML | Multi-group Agnostic PAC Learnability. | Guy N. Rothblum, Gal Yona |
| 2021 | STOC | Outcome indistinguishability. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 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 | FOCS | Learning from Outcomes: Evidence-Based Rankings. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 2019 | SODA | Fine-grained Complexity Meets IP = PSPACE. | Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein |
| 2019 | STOC | Gentle measurement of quantum states and differential privacy. | Scott Aaronson, Guy N. Rothblum |
| 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 | Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. | Arka Rai Choudhuri, Pavel Hubcek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum |
| 2019 | TCC | Incrementally Verifiable Computation via Incremental PCPs. | Moni Naor, Omer Paneth, Guy N. Rothblum |
| 2018 | FOCS | Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. | Oded Goldreich, Guy N. Rothblum |
| 2018 | ICML | Multicalibration: Calibration for the (Computationally-Identifiable) Masses. | rsula Hbert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum |
| 2018 | ICML | Probably Approximately Metric-Fair Learning. | Gal Yona, Guy N. Rothblum |
| 2018 | STOC | Composable and versatile privacy via truncated CDP. | Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke |
| 2017 | CRYPTO | From Obfuscation to the Security of Fiat-Shamir for Proofs. | Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum |
| 2017 | TCC | On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. | Omer Paneth, Guy N. Rothblum |
| 2016 | CRYPTO | Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. | Cynthia Dwork, Moni Naor, Guy N. Rothblum |
| 2016 | STOC | Constant-round interactive proofs for delegating computation. | Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2015 | ASIACRYPT | Pure Differential Privacy for Rectangle Queries via Private Partitions. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum |
| 2014 | ICALP | Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). | Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2014 | TCC | Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. | Zvika Brakerski, Guy N. Rothblum |
| 2013 | CRYPTO | Obfuscating Conjunctions. | Zvika Brakerski, Guy N. Rothblum |
| 2013 | STOC | Interactive proofs of proximity: delegating computation in sublinear time. | Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson |
| 2012 | CRYPTO | How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware. | Guy N. Rothblum |
| 2012 | FOCS | How to Compute in the Presence of Leakage. | Shafi Goldwasser, Guy N. Rothblum |
| 2012 | SODA | Private data release via learning thresholds. | Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio |
| 2011 | ASIACRYPT | Program Obfuscation with Leaky Hardware. | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum |
| 2011 | CCS | Practical delegation of computation using multiple servers. | Ran Canetti, Ben Riva, Guy N. Rothblum |
| 2010 | CRYPTO | Securing Computation against Continuous Leakage. | Shafi Goldwasser, Guy N. Rothblum |
| 2010 | FOCS | Boosting and Differential Privacy. | Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan |
| 2010 | FOCS | A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. | Moritz Hardt, Guy N. Rothblum |
| 2010 | STOC | Differential privacy under continual observation. | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum |
| 2010 | TCC | Obfuscation of Hyperplane Membership. | Ran Canetti, Guy N. Rothblum, Mayank Varia |
| 2010 | TCC | Leakage-Resilient Signatures. | Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum |
| 2009 | STOC | On the complexity of differentially private data release: efficient algorithms and hardness results. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
| 2009 | TCC | Weak Verifiable Random Functions. | Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan |
| 2009 | TCC | How Efficient Can Memory Checking Be?. | Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan |
| 2008 | CRYPTO | One-Time Programs. | Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum |
| 2008 | STOC | A (de)constructive approach to program checking. | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
| 2008 | STOC | Delegating computation: interactive proofs for muggles. | Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum |
| 2007 | FUN | Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum |
| 2007 | STOC | Verifying and decoding in constant depth. | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
| 2007 | TCC | On Best-Possible Obfuscation. | Shafi Goldwasser, Guy N. Rothblum |
| 2007 | TCC | Securely Obfuscating Re-encryption. | Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan |
| 2006 | ICML | Learning to impersonate. | Moni Naor, Guy N. Rothblum |
| 2005 | FOCS | The Complexity of Online Memory Checking. | Moni Naor, Guy N. Rothblum |