| 2026 | SP | Generate-then-Verify: Reconstructing Data from Limited Published Statistics. | Terrance Liu, Eileen Xiao, Adam D. Smith, Pratiksha Thaker, Zhiwei Steven Wu |
| 2023 | CCS | Control, Confidentiality, and the Right to be Forgotten. | Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan |
| 2023 | ICML | The Price of Differential Privacy under Continual Observation. | Palak Jain, Sofya Raskhodnikova, Satchit Sivakumar, Adam D. Smith |
| 2023 | PODS | Node-Differentially Private Estimation of the Number of Connected Components. | Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis |
| 2022 | COLT | Strong Memory Lower Bounds for Learning Natural Models. | Gavin Brown, Mark Bun, Adam D. Smith |
| 2021 | STOC | When is memorization of irrelevant training data necessary for high-accuracy learning? | Gavin Brown, Mark Bun, Vitaly Feldman, Adam D. Smith, Kunal Talwar |
| 2021 | SP | Manipulation Attacks in Local Differential Privacy. | Albert Cheu, Adam D. Smith, Jonathan R. Ullman |
| 2020 | AISTATS | Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis. | Ryan Rogers, Aaron Roth, Adam D. Smith, Nathan Srebro, Om Thakkar, Blake E. Woodworth |
| 2019 | ALT | Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations. | Di Wang, Adam D. Smith, Jinhui Xu |
| 2019 | EuroCrypt | Distributed Differential Privacy via Shuffling. | Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, Maxim Zhilyaev |
| 2019 | STOC | The structure of optimal private tests for simple hypotheses. | Clment L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan R. Ullman |
| 2018 | FOCS | Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. | Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik |
| 2017 | SP | Is Interaction Necessary for Distributed Private Learning? | Adam D. Smith, Abhradeep Thakurta, Jalaj Upadhyay |
| 2016 | ASIACRYPT | When Are Fuzzy Extractors Possible? | Benjamin Fuller, Leonid Reyzin, Adam D. Smith |
| 2016 | EuroCrypt | Reusable Fuzzy Extractors for Low-Entropy Distributions. | Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith |
| 2016 | FOCS | Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism. | Sofya Raskhodnikova, Adam D. Smith |
| 2016 | FOCS | Max-Information, Differential Privacy, and Post-selection Hypothesis Testing. | Ryan M. Rogers, Aaron Roth, Adam D. Smith, Om Thakkar |
| 2016 | STOC | Algorithmic stability for adaptive data analysis. | Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan R. Ullman |
| 2015 | FOCS | Robust Traceability from Trace Amounts. | Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan |
| 2015 | STOC | Local, Private, Efficient Protocols for Succinct Histograms. | Raef Bassily, Adam D. Smith |
| 2015 | TCC | On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption. | Adam D. Smith, Ye Zhang |
| 2014 | FOCS | Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds. | Raef Bassily, Adam D. Smith, Abhradeep Thakurta |
| 2014 | SODA | Causal Erasure Channels. | Raef Bassily, Adam D. Smith |
| 2013 | COLT | Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso. | Abhradeep Thakurta, Adam D. Smith |
| 2013 | EuroCrypt | Regularity of Lossy RSA on Subdomains and Its Applications. | Mark Lewko, Adam O'Neill, Adam D. Smith |
| 2013 | FOCS | Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy. | Raef Bassily, Adam Groce, Jonathan Katz, Adam D. Smith |
| 2013 | SODA | The Power of Linear Reconstruction Attacks. | Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D. Smith |
| 2013 | TCC | Analyzing Graphs with Node Differential Privacy. | Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith |
| 2011 | CRYPTO | Classical Cryptographic Protocols in a Quantum World. | Sean Hallgren, Adam D. Smith, Fang Song |
| 2011 | STOC | Privacy-preserving statistical estimation with optimal convergence rates. | Adam D. Smith |
| 2010 | CRYPTO | Instantiability of RSA-OAEP under Chosen-Plaintext Attack. | Eike Kiltz, Adam O'Neill, Adam D. Smith |
| 2010 | FOCS | Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. | Venkatesan Guruswami, Adam D. Smith |
| 2010 | ISIT | Leftover Hashing against quantum side information. | Marco Tomamichel, Renato Renner, Christian Schaffner, Adam D. Smith |
| 2010 | KDD | Discovering frequent patterns in sensitive data. | Raghav Bhaskar, Srivatsan Laxman, Adam D. Smith, Abhradeep Thakurta |
| 2010 | STOC | The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. | Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D. Smith, Jonathan R. Ullman |
| 2009 | CANS | Asymptotically Optimal and Private Statistical Estimation. | Adam D. Smith |
| 2009 | TCC | Composability and On-Line Deniability of Authentication. | Yevgeniy Dodis, Jonathan Katz, Adam D. Smith, Shabsi Walfish |
| 2008 | ACSAC | Defending Against Attacks on Main Memory Persistence. | William Enck, Kevin R. B. Butler, Thomas Richardson, Patrick D. McDaniel, Adam D. Smith |
| 2008 | CRYPTO | Scalable Multiparty Computation with Nearly Optimal Work and Resilience. | Ivan Damgrd, Yuval Ishai, Mikkel Krigaard, Jesper Buus Nielsen, Adam D. Smith |
| 2008 | EuroCrypt | Efficient Two Party and Multi Party Computation Against Covert Adversaries. | Vipul Goyal, Payman Mohassel, Adam D. Smith |
| 2008 | FOCS | What Can We Learn Privately? | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith |
| 2008 | KDD | Composition attacks and auxiliary information in data privacy. | Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam D. Smith |
| 2007 | FOCS | Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith |
| 2007 | SODA | Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. | Adam D. Smith |
| 2007 | STOC | Smooth sensitivity and sampling in private data analysis. | Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith |
| 2006 | CRYPTO | Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. | Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam D. Smith |
| 2006 | CRYPTO | Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. | Moni Naor, Gil Segev, Adam D. Smith |
| 2006 | FOCS | Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. | Michael Ben-Or, Claude Crpeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith |
| 2006 | TCC | Calibrating Noise to Sensitivity in Private Data Analysis. | Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith |
| 2005 | EuroCrypt | Secure Remote Authentication Using Biometric Data. | Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith |
| 2005 | EuroCrypt | Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. | Claude Crpeau, Daniel Gottesman, Adam D. Smith |
| 2005 | STOC | Correcting errors without leaking partial information. | Yevgeniy Dodis, Adam D. Smith |
| 2005 | TCC | Toward Privacy in Public Databases. | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee |
| 2005 | TCC | Entropic Security and the Encryption of High Entropy Messages. | Yevgeniy Dodis, Adam D. Smith |
| 2004 | EuroCrypt | Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. | Yevgeniy Dodis, Leonid Reyzin, Adam D. Smith |
| 2004 | ICALP | Efficient Consistency Proofs for Generalized Queries on a Committed Database. | Rafail Ostrovsky, Charles Rackoff, Adam D. Smith |
| 2004 | TCC | List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. | Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan |
| 2003 | EuroCrypt | Round Efficiency of Multi-party Computation with a Dishonest Majority. | Jonathan Katz, Rafail Ostrovsky, Adam D. Smith |
| 2003 | SODA | Lower bounds for collusion-secure fingerprinting. | Chris Peikert, Abhi Shelat, Adam D. Smith |
| 2002 | FOCS | Authentication of Quantum Messages. | Howard Barnum, Claude Crpeau, Daniel Gottesman, Adam D. Smith, Alain Tapp |
| 2002 | PODC | Detectable byzantine agreement secure against faulty majorities. | Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith |
| 2002 | STOC | Secure multi-party quantum computation. | Claude Crpeau, Daniel Gottesman, Adam D. Smith |
| 2001 | ASIACRYPT | Mutually Independent Commitments. | Moses D. Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam D. Smith |
| 2001 | EuroCrypt | Efficient and Non-interactive Non-malleable Commitment. | Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith |
| 2001 | EuroCrypt | On Perfect and Adaptive Security in Exposure-Resilient Cryptography. | Yevgeniy Dodis, Amit Sahai, Adam D. Smith |