| 2026 | SP | Making Privacy Public: Toward a Differential Privacy Deployment Registry. | Priyanka Nanayakkara, Elena Ghazi, Salil P. Vadhan |
| 2025 | TCC | Generalized and Unified Equivalences Between Hardness and Pseudoentropy. | Lunjia Hu, Salil P. Vadhan |
| 2025 | TCC | Securing Unbounded Differential Privacy Against Timing Attacks. | Zachary Ratliff, Salil P. Vadhan |
| 2024 | CCS | A Framework for Differential Privacy Against Timing Attacks. | Zachary Ratliff, Salil P. Vadhan |
| 2024 | STOC | Complexity-Theoretic Implications of Multicalibration. | Slvia Casacuberta, Cynthia Dwork, Salil P. Vadhan |
| 2023 | CCS | Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. | Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang |
| 2023 | CHI | Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. | Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan |
| 2023 | FOCS | Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. | AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan |
| 2023 | STOC | Concurrent Composition Theorems for Differential Privacy. | Salil P. Vadhan, Wanrong Zhang |
| 2022 | CCS | Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. | Slvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman |
| 2021 | COCOON | Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. | Edward Pyne, Salil P. Vadhan |
| 2021 | TCC | Concurrent Composition of Differential Privacy. | Salil P. Vadhan, Tianhao Wang |
| 2020 | FOCS | High-precision Estimation of Random Walks in Small Space. | AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan |
| 2020 | ICALP | Spectral Sparsification via Bounded-Independence Sampling. | Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman |
| 2019 | CRYPTO | Unifying Computational Entropies via Kullback-Leibler Divergence. | Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan |
| 2017 | COLT | On Learning vs. Refutation. | Salil P. Vadhan |
| 2017 | FOCS | Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. | Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan |
| 2016 | ICML | Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. | Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan |
| 2016 | PODS | Locating a Small Cluster Privately. | Kobbi Nissim, Uri Stemmer, Salil P. Vadhan |
| 2016 | TCC | Separating Computational and Statistical Differential Privacy in the Client-Server Model. | Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan |
| 2016 | TCC | The Complexity of Computing the Optimal Composition of Differential Privacy. | Jack Murtagh, Salil P. Vadhan |
| 2015 | FOCS | Differentially Private Release and Learning of Threshold Functions. | Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan |
| 2015 | FOCS | Robust Traceability from Trace Amounts. | Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan |
| 2014 | STOC | Fingerprinting codes and the price of approximate differential privacy. | Mark Bun, Jonathan R. Ullman, Salil P. Vadhan |
| 2013 | CRYPTO | A Uniform Min-Max Theorem with Applications in Cryptography. | Salil P. Vadhan, Colin Jia Zheng |
| 2013 | EuroCrypt | Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. | Ananth Raghunathan, Gil Segev, Salil P. Vadhan |
| 2013 | STOC | Interactive proofs of proximity: delegating computation in sublinear time. | Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson |
| 2012 | CRYPTO | Differential Privacy with Imperfect Randomness. | Yevgeniy Dodis, Adriana Lpez-Alt, Ilya Mironov, Salil P. Vadhan |
| 2012 | FOCS | The Privacy of the Analyst and the Power of the State. | Cynthia Dwork, Moni Naor, Salil P. Vadhan |
| 2012 | FOCS | Better Pseudorandom Generators from Milder Pseudorandom Restrictions. | Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2012 | ICALP | Faster Algorithms for Privately Releasing Marginals. | Justin Thaler, Jonathan R. Ullman, Salil P. Vadhan |
| 2012 | ITW | Characterizing pseudoentropy. | Salil P. Vadhan, Colin Jia Zheng |
| 2012 | STOC | Characterizing pseudoentropy and simplifying pseudorandom generator constructions. | Salil P. Vadhan, Colin Jia Zheng |
| 2012 | TCC | Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. | Yevgeniy Dodis, Thomas Ristenpart, Salil P. Vadhan |
| 2011 | CRYPTO | Time-Lock Puzzles in the Random Oracle Model. | Mohammad Mahmoody, Tal Moran, Salil P. Vadhan |
| 2011 | TCC | PCPs and the Hardness of Generating Private Synthetic Data. | Jonathan R. Ullman, Salil P. Vadhan |
| 2010 | CRYPTO | Improved Delegation of Computation Using Fully Homomorphic Encryption. | Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan |
| 2010 | EuroCrypt | Universal One-Way Hash Functions via Inaccessible Entropy. | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
| 2010 | FOCS | Boosting and Differential Privacy. | Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan |
| 2010 | FOCS | The Limits of Two-Party Differential Privacy. | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
| 2010 | STOC | Efficiency improvements in constructing pseudorandom generators from one-way functions. | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
| 2010 | TCC | Composition of Zero-Knowledge Proofs with Efficient Provers. | Eleanor Birrell, Salil P. Vadhan |
| 2009 | CRYPTO | Computational Differential Privacy. | Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan |
| 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 | STOC | Inaccessible entropy. | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
| 2009 | TCC | Proofs of Retrievability via Hardness Amplification. | Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs |
| 2009 | TCC | Fairness with an Honest Minority and a Rational Majority. | Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan |
| 2008 | FOCS | Dense Subsets of Pseudorandom Sets. | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
| 2008 | SODA | Why simple hash functions work: exploiting the entropy in a data stream. | Michael Mitzenmacher, Salil P. Vadhan |
| 2008 | TCC | Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. | Andr Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
| 2008 | TCC | An Equivalence Between Zero Knowledge and Commitments. | Shien Jin Ong, Salil P. Vadhan |
| 2007 | CRYPTO | Amplifying Collision Resistance: A Complexity-Theoretic Treatment. | Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee |
| 2007 | EuroCrypt | Zero Knowledge and Soundness Are Symmetric. | Shien Jin Ong, Salil P. Vadhan |
| 2006 | CRYPTO | Random Selection with an Adversarial Majority. | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
| 2006 | FOCS | Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. | Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan |
| 2006 | STOC | Deterministic extractors for small-space sources. | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
| 2006 | STOC | Zero knowledge with efficient provers. | Minh-Huyen Nguyen, Salil P. Vadhan |
| 2006 | STOC | Pseudorandom walks on regular digraphs and the RL vs. L problem. | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2006 | TCC | Concurrent Zero Knowledge Without Complexity Assumptions. | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
| 2005 | STOC | The round complexity of two-party random selection. | Saurabh Sanghvi, Salil P. Vadhan |
| 2004 | FOCS | An Unconditional Study of Computational Zero Knowledge. | Salil P. Vadhan |
| 2004 | STOC | Robust pcps of proximity, shorter pcps and applications to coding. | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
| 2004 | STOC | Using nondeterminism to amplify hardness. | Alexander Healy, Salil P. Vadhan, Emanuele Viola |
| 2004 | TCC | Simpler Session-Key Generation from Short Random Passwords. | Minh-Huyen Nguyen, Salil P. Vadhan |
| 2004 | TCC | Notions of Reducibility between Cryptographic Primitives. | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2003 | CRYPTO | Derandomization in Cryptography. | Boaz Barak, Shien Jin Ong, Salil P. Vadhan |
| 2003 | CRYPTO | Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. | Daniele Micciancio, Salil P. Vadhan |
| 2003 | CRYPTO | On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. | Salil P. Vadhan |
| 2003 | FOCS | Lower Bounds for Non-Black-Box Zero Knowledge. | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
| 2003 | STOC | Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. | Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson |
| 2003 | STOC | Extractors: optimal up to constant factors. | Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
| 2002 | FOCS | Randomness Extractors and their Many Guises. | Salil P. Vadhan |
| 2002 | STOC | Randomness conductors and constant-degree lossless expanders. | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
| 2002 | SCN | An Improved Pseudorandom Generator Based on Hardness of Factoring. | Nenad Dedic, Leonid Reyzin, Salil P. Vadhan |
| 2001 | CRYPTO | On the (Im)possibility of Obfuscating Programs. | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
| 2001 | ICALP | On Interactive Proofs with a Laconic Prover. | Oded Goldreich, Salil P. Vadhan, Avi Wigderson |
| 2000 | FOCS | Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. | Omer Reingold, Salil P. Vadhan, Avi Wigderson |
| 2000 | FOCS | Extracting Randomness from Samplable Distributions. | Luca Trevisan, Salil P. Vadhan |
| 2000 | STOC | On transformation of interactive proofs that preserve the prover's complexity. | Salil P. Vadhan |
| 1999 | CRYPTO | Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. | Oded Goldreich, Amit Sahai, Salil P. Vadhan |
| 1999 | FOCS | Verifiable Random Functions. | Silvio Micali, Michael O. Rabin, Salil P. Vadhan |
| 1999 | FOCS | Error Reduction for Extractors. | Ran Raz, Omer Reingold, Salil P. Vadhan |
| 1999 | STOC | Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. | Ran Raz, Omer Reingold, Salil P. Vadhan |
| 1999 | STOC | Pseudorandom Generators Without the XOR Lemma (Extended Abstract). | Madhu Sudan, Luca Trevisan, Salil P. Vadhan |
| 1998 | CRYPTO | Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. | Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan |
| 1998 | STOC | The Power of a Pebble: Exploring and Mapping Directed Graphs. | Michael A. Bender, Antonio Fernndez, Dana Ron, Amit Sahai, Salil P. Vadhan |
| 1998 | STOC | Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. | Oded Goldreich, Amit Sahai, Salil P. Vadhan |
| 1998 | STOC | Checking Polynomial Identities over any Field: Towards a Derandomization? | Daniel Lewin, Salil P. Vadhan |
| 1997 | FOCS | A Complete Promise Problem for Statistical Zero-Knowledge. | Amit Sahai, Salil P. Vadhan |