Salil P. Vadhan

331 papers A* 71A 25B 12Misc 2Journal 187Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bounded Independence Edge Sampling for Combinatorial Graph Properties. CoRR Aaron Putterman, Salil P. Vadhan, Vadim Zaripov
2025	J	`jnl`	Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression. Proc. Priv. Enhancing Technol. Jayshree Sarathy, Salil P. Vadhan
2025	A	`conf`	Characterizing the Distinguishability of Product Distributions Through Multicalibration. CCC Cassandra Marcussen, Aaron Putterman, Salil P. Vadhan
2025	—	`conf`	Generalized and Unified Equivalences Between Hardness and Pseudoentropy. TCC (4) Lunjia Hu, Salil P. Vadhan
2025	J	`jnl`	Generalized and Unified Equivalences between Hardness and Pseudoentropy. CoRR Lunjia Hu, Salil P. Vadhan
2025	J	`jnl`	Obituary for Luca Trevisan. Bull. EATCS Andrea Clementi, Venkatesan Guruswami, Kristin Kane, Alon Rosen, Nikhil Srivastava, Salil P. Vadhan, Riccardo Zecchina
2025	J	`jnl`	Practitioners' Perspectives on a Differential Privacy Deployment Registry. CoRR Priyanka Nanayakkara, Elena Ghazi, Salil P. Vadhan
2025	—	`conf`	Securing Unbounded Differential Privacy Against Timing Attacks. TCC (4) Zachary Ratliff, Salil P. Vadhan
2025	J	`jnl`	Securing Unbounded Differential Privacy Against Timing Attacks. CoRR Zachary Ratliff, Salil P. Vadhan
2025	J	`jnl`	Singular Values Versus Expansion in Directed and Undirected Graphs. CoRR Jake Ruotolo, Salil P. Vadhan
2025	A	`conf`	Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley Graphs. APPROX/RANDOM Tommaso d'Orsi, Chris Jones, Jake Ruotolo, Salil P. Vadhan, Jiyu Zhang
2025	A	`conf`	The Randomness Complexity of Differential Privacy. ITCS Clément L. Canonne, Francis E. Su, Salil P. Vadhan
2024	J	`jnl`	"I inherently just trust that it works": Investigating Mental Models of Open-Source Libraries for Differential Privacy. CoRR Patrick Song, Jayshree Sarathy, Michael Shoemate, Salil P. Vadhan
2024	J	`jnl`	"I inherently just trust that it works": Investigating Mental Models of Open-Source Libraries for Differential Privacy. Proc. ACM Hum. Comput. Interact. Patrick Song, Jayshree Sarathy, Michael Shoemate, Salil P. Vadhan
2024	A*	`conf`	A Framework for Differential Privacy Against Timing Attacks. CCS Zachary Ratliff, Salil P. Vadhan
2024	J	`jnl`	A Framework for Differential Privacy Against Timing Attacks. CoRR Zachary Ratliff, Salil P. Vadhan
2024	J	`jnl`	Characterizing the Distinguishability of Product Distributions through Multicalibration. CoRR Cassandra Marcussen, Aaron (Louie) Putterman, Salil P. Vadhan
2024	A*	`conf`	Complexity-Theoretic Implications of Multicalibration. STOC Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan
2024	J	`jnl`	Concurrent Composition for Continual Mechanisms. CoRR Monika Henzinger, Roodabeh Safavi, Salil P. Vadhan
2024	J	`jnl`	Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. Algorithmica William M. Hoza, Edward Pyne, Salil P. Vadhan
2024	J	`jnl`	Membership Inference Attacks and Privacy in Topic Modeling. CoRR Nico Manzonelli, Wanrong Zhang, Salil P. Vadhan
2024	J	`jnl`	Membership Inference Attacks and Privacy in Topic Modeling. Trans. Mach. Learn. Res. Nico Manzonelli, Wanrong Zhang, Salil P. Vadhan
2024	J	`jnl`	Programming Frameworks for Differential Privacy. CoRR Marco Gaboardi, Michael Hay, Salil P. Vadhan
2024	J	`jnl`	Small-Space Spectral Sparsification via Bounded-Independence Sampling. ACM Trans. Comput. Theory Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2024	J	`jnl`	Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs. CoRR Tommaso d'Orsi, Chris Jones, Jake Ruotolo, Salil P. Vadhan, Jiyu Zhang
2024	J	`jnl`	The Randomness Complexity of Differential Privacy. Electron. Colloquium Comput. Complex. Clément L. Canonne, Francis E. Su, Salil P. Vadhan
2023	J	`jnl`	Black-Box Training Data Identification in GANs via Detector Networks. CoRR Lukman Olagoke, Salil P. Vadhan, Seth Neel
2023	J	`jnl`	Complexity-Theoretic Implications of Multicalibration. CoRR Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan
2023	A*	`conf`	Concurrent Composition Theorems for Differential Privacy. STOC Salil P. Vadhan, Wanrong Zhang
2023	A*	`conf`	Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CCS Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang
2023	J	`jnl`	Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CoRR Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang
2023	J	`jnl`	Differentially Private Hypothesis Testing for Linear Regression. J. Mach. Learn. Res. Daniel Alabi, Salil P. Vadhan
2023	A*	`conf`	Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CHI Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan
2023	J	`jnl`	Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CoRR Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan
2023	A	`conf`	On the Power of Regular and Permutation Branching Programs. APPROX/RANDOM Chin Ho Lee, Edward Pyne, Salil P. Vadhan
2023	J	`jnl`	On the Power of Regular and Permutation Branching Programs. Electron. Colloquium Comput. Complex. Chin Ho Lee, Edward Pyne, Salil P. Vadhan
2023	J	`jnl`	On the works of Avi Wigderson. CoRR Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi
2023	J	`jnl`	Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. CoRR AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan
2023	A*	`conf`	Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. FOCS AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan
2022	J	`jnl`	Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression. CoRR Jayshree Sarathy, Salil P. Vadhan
2022	J	`jnl`	Concurrent Composition Theorems for all Standard Variants of Differential Privacy. CoRR Salil P. Vadhan, Wanrong Zhang
2022	—	`conf`	Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. SOSA Edward Pyne, Salil P. Vadhan
2022	J	`jnl`	Differentially Private Simple Linear Regression. Proc. Priv. Enhancing Technol. Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan
2022	A	`conf`	Fourier Growth of Regular Branching Programs. APPROX/RANDOM Chin Ho Lee, Edward Pyne, Salil P. Vadhan
2022	J	`jnl`	Fourier Growth of Regular Branching Programs. Electron. Colloquium Comput. Complex. Chin Ho Lee, Edward Pyne, Salil P. Vadhan
2022	A*	`conf`	Hypothesis Testing for Differentially Private Linear Regression. NeurIPS Daniel Alabi, Salil P. Vadhan
2022	J	`jnl`	Hypothesis Testing for Differentially Private Linear Regression. CoRR Daniel Alabi, Salil P. Vadhan
2022	A	`conf`	Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. CCC Louis Golowich, Salil P. Vadhan
2022	J	`jnl`	Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Electron. Colloquium Comput. Complex. Louis Golowich, Salil P. Vadhan
2022	A*	`conf`	Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CCS Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman
2022	J	`jnl`	Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CoRR Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman
2021	J	`jnl`	Canonical Noise Distributions and Private Hypothesis Tests. CoRR Jordan Awan, Salil P. Vadhan
2021	—	`conf`	Concurrent Composition of Differential Privacy. TCC (2) Salil P. Vadhan, Tianhao Wang
2021	J	`jnl`	Concurrent Composition of Differential Privacy. CoRR Salil P. Vadhan, Tianhao Wang
2021	J	`jnl`	Concurrent Composition of Differential Privacy. IACR Cryptol. ePrint Arch. Salil P. Vadhan, Tianhao Wang
2021	J	`jnl`	Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. SIAM J. Comput. Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2021	J	`jnl`	Deterministic Approximation of Random Walks in Small Space. Theory Comput. Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2021	J	`jnl`	Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. CoRR Edward Pyne, Salil P. Vadhan
2021	J	`jnl`	Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2021	Misc	`conf`	Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. COCOON Edward Pyne, Salil P. Vadhan
2021	J	`jnl`	Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. Electron. Colloquium Comput. Complex. Edward Pyne, Salil P. Vadhan
2021	J	`jnl`	Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	A	`conf`	Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). CCC Edward Pyne, Salil P. Vadhan
2021	J	`jnl`	Pseudodistributions That Beat All Pseudorandom Generators. Electron. Colloquium Comput. Complex. Edward Pyne, Salil P. Vadhan
2021	—	`conf`	Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	A	`conf`	Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS William M. Hoza, Edward Pyne, Salil P. Vadhan
2020	J	`jnl`	Differentially Private Simple Linear Regression. CoRR Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan
2020	A*	`conf`	High-precision Estimation of Random Walks in Small Space. FOCS AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan
2020	J	`jnl`	Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020	J	`jnl`	Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020	J	`jnl`	PCPs and the Hardness of Generating Synthetic Data. J. Cryptol. Jonathan R. Ullman, Salil P. Vadhan
2020	J	`jnl`	Privacy Games. ACM Trans. Economics and Comput. Yiling Chen, Or Sheffet, Salil P. Vadhan
2020	J	`jnl`	Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. Electron. Colloquium Comput. Complex. William Hoza, Edward Pyne, Salil P. Vadhan
2020	A*	`conf`	Spectral Sparsification via Bounded-Independence Sampling. ICALP Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	J	`jnl`	Spectral Sparsification via Bounded-Independence Sampling. CoRR Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	J	`jnl`	Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	—	`ch.`	When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan
2019	—	`ch.`	Computational entropy. Providing Sound Foundations for Cryptography Salil P. Vadhan
2019	—	`conf`	Deterministic Approximation of Random Walks in Small Space. APPROX-RANDOM Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2019	J	`jnl`	Deterministic Approximation of Random Walks in Small Space. CoRR Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2019	J	`jnl`	Differential Privacy on Finite Computers. J. Priv. Confidentiality Victor Balcer, Salil P. Vadhan
2019	J	`jnl`	High-precision Estimation of Random Walks in Small Space. CoRR AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan
2019	—	`conf`	Unifying Computational Entropies via Kullback-Leibler Divergence. CRYPTO (2) Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan
2019	J	`jnl`	Unifying computational entropies via Kullback-Leibler divergence. CoRR Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan
2019	J	`jnl`	Unifying computational entropies via Kullback-Leibler divergence. IACR Cryptol. ePrint Arch. Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan
2018	A	`conf`	A Tight Lower Bound for Entropy Flattening. CCC Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang
2018	J	`jnl`	A Tight Lower Bound for Entropy Flattening. Electron. Colloquium Comput. Complex. Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang
2018	J	`jnl`	Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. J. Cryptol. Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2018	A	`conf`	Differential Privacy on Finite Computers. ITCS Victor Balcer, Salil P. Vadhan
2018	J	`jnl`	Fingerprinting Codes and the Price of Approximate Differential Privacy. SIAM J. Comput. Mark Bun, Jonathan R. Ullman, Salil P. Vadhan
2018	A	`conf`	Finite Sample Differentially Private Confidence Intervals. ITCS Vishesh Karwa, Salil P. Vadhan
2018	J	`jnl`	The Complexity of Computing the Optimal Composition of Differential Privacy. Theory Comput. Jack Murtagh, Salil P. Vadhan
2018	J	`jnl`	Usable Differential Privacy: A Case Study with PSI. CoRR Jack Murtagh, Kathryn Taylor, George Kellaris, Salil P. Vadhan
2017	J	`jnl`	Computational Notions of Quantum Min-Entropy. CoRR Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, Xiaodi Wu
2017	A*	`conf`	Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2017	J	`jnl`	Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2017	J	`jnl`	Differential Privacy on Finite Computers. CoRR Victor Balcer, Salil P. Vadhan
2017	J	`jnl`	Finite Sample Differentially Private Confidence Intervals. CoRR Vishesh Karwa, Salil P. Vadhan
2017	A*	`conf`	On Learning vs. Refutation. COLT Salil P. Vadhan
2017	J	`jnl`	Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs. Theory Comput. Thomas Steinke, Salil P. Vadhan, Andrew Wan
2017	—	`ch.`	The Complexity of Differential Privacy. Tutorials on the Foundations of Cryptography Salil P. Vadhan
2017	—	`ch.`	The Many Entropies in One-Way Functions. Tutorials on the Foundations of Cryptography Iftach Haitner, Salil P. Vadhan
2017	J	`jnl`	The Many Entropies in One-Way Functions. Electron. Colloquium Comput. Complex. Iftach Haitner, Salil P. Vadhan
2016	A*	`conf`	Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. ICML Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan
2016	J	`jnl`	Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. CoRR Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan
2016	A*	`conf`	Locating a Small Cluster Privately. PODS Kobbi Nissim, Uri Stemmer, Salil P. Vadhan
2016	J	`jnl`	Locating a Small Cluster Privately. CoRR Kobbi Nissim, Uri Stemmer, Salil P. Vadhan
2016	J	`jnl`	PSI (Ψ): a Private data Sharing Interface. CoRR Marco Gaboardi, James Honaker, Gary King, Kobbi Nissim, Jonathan R. Ullman, Salil P. Vadhan
2016	—	`conf`	Privacy Odometers and Filters: Pay-as-you-Go Composition. NIPS Ryan M. Rogers, Salil P. Vadhan, Aaron Roth, Jonathan R. Ullman
2016	J	`jnl`	Privacy Odometers and Filters: Pay-as-you-Go Composition. CoRR Ryan M. Rogers, Aaron Roth, Jonathan R. Ullman, Salil P. Vadhan
2016	—	`conf`	Separating Computational and Statistical Differential Privacy in the Client-Server Model. TCC (B1) Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan
2016	J	`jnl`	Separating Computational and Statistical Differential Privacy in the Client-Server Model. IACR Cryptol. ePrint Arch. Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan
2016	—	`conf`	The Complexity of Computing the Optimal Composition of Differential Privacy. TCC (A1) Jack Murtagh, Salil P. Vadhan
2016	J	`jnl`	Towards a Privacy Research Roadmap for the Computing Community. CoRR Lorrie Faith Cranor, Tal Rabin, Vitaly Shmatikov, Salil P. Vadhan, Daniel J. Weitzner
2016	J	`jnl`	Truthful Mechanisms for Agents That Value Privacy. ACM Trans. Economics and Comput. Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan
2015	A*	`conf`	Differentially Private Release and Learning of Threshold Functions. FOCS Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan
2015	J	`jnl`	Differentially Private Release and Learning of Threshold Functions. CoRR Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan
2015	J	`jnl`	Pseudorandomness for Read-Once, Constant-Depth Circuits. CoRR Sitan Chen, Thomas Steinke, Salil P. Vadhan
2015	A*	`conf`	Robust Traceability from Trace Amounts. FOCS Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan
2015	J	`jnl`	The Complexity of Computing the Optimal Composition of Differential Privacy. CoRR Jack Murtagh, Salil P. Vadhan
2015	J	`jnl`	The Complexity of Computing the Optimal Composition of Differential Privacy. IACR Cryptol. ePrint Arch. Jack Murtagh, Salil P. Vadhan
2014	A*	`conf`	Fingerprinting codes and the price of approximate differential privacy. STOC Mark Bun, Jonathan R. Ullman, Salil P. Vadhan
2014	A	`conf`	Locally testable codes and cayley graphs. ITCS Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
2014	—	`conf`	Privacy Games. WINE Yiling Chen, Or Sheffet, Salil P. Vadhan
2014	J	`jnl`	Privacy Games. CoRR Yiling Chen, Or Sheffet, Salil P. Vadhan
2014	J	`jnl`	Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs. CoRR Thomas Steinke, Salil P. Vadhan, Andrew Wan
2014	—	`conf`	Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs. APPROX-RANDOM Thomas Steinke, Salil P. Vadhan, Andrew Wan
2014	J	`jnl`	Redrawing the Boundaries on Purchasing Data from Privacy-Sensitive Individuals. CoRR Kobbi Nissim, Salil P. Vadhan, David Xiao
2014	A	`conf`	Redrawing the boundaries on purchasing data from privacy-sensitive individuals. ITCS Kobbi Nissim, Salil P. Vadhan, David Xiao
2013	—	`conf`	A Uniform Min-Max Theorem with Applications in Cryptography. CRYPTO (1) Salil P. Vadhan, Colin Jia Zheng
2013	J	`jnl`	A Uniform Min-Max Theorem with Applications in Cryptography. Electron. Colloquium Comput. Complex. Colin Jia Zheng, Salil P. Vadhan
2013	J	`jnl`	A Uniform Min-Max Theorem with Applications in Cryptography. IACR Cryptol. ePrint Arch. Salil P. Vadhan, Colin Jia Zheng
2013	A*	`conf`	Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. EUROCRYPT Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2013	J	`jnl`	Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. IACR Cryptol. ePrint Arch. Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2013	J	`jnl`	Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. Iftach Haitner, Omer Reingold, Salil P. Vadhan
2013	J	`jnl`	Fingerprinting Codes and the Price of Approximate Differential Privacy. CoRR Mark Bun, Jonathan R. Ullman, Salil P. Vadhan
2013	A*	`conf`	Interactive proofs of proximity: delegating computation in sublinear time. STOC Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson
2013	J	`jnl`	Locally Testable Codes and Cayley Graphs. CoRR Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
2013	J	`jnl`	Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
2013	J	`jnl`	On extractors and exposure-resilient functions for sublogarithmic entropy. Random Struct. Algorithms Yakir Reshef, Salil P. Vadhan
2013	—	`conf`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM Omer Reingold, Thomas Steinke, Salil P. Vadhan
2013	J	`jnl`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR Omer Reingold, Thomas Steinke, Salil P. Vadhan
2013	J	`jnl`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. Electron. Colloquium Comput. Complex. Omer Reingold, Thomas Steinke, Salil P. Vadhan
2013	A	`conf`	Publicly verifiable proofs of sequential work. ITCS Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
2013	A*	`conf`	Truthful mechanisms for agents that value privacy. EC Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan
2013	J	`jnl`	Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan
2012	J	`jnl`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions CoRR Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	A*	`conf`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	J	`jnl`	Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	A*	`conf`	Characterizing pseudoentropy and simplifying pseudorandom generator constructions. STOC Salil P. Vadhan, Colin Jia Zheng
2012	B	`conf`	Characterizing pseudoentropy. ITW Salil P. Vadhan, Colin Jia Zheng
2012	A*	`conf`	Differential Privacy with Imperfect Randomness. CRYPTO Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan
2012	J	`jnl`	Differential Privacy with Imperfect Randomness. IACR Cryptol. ePrint Arch. Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan
2012	J	`jnl`	Faster Algorithms for Privately Releasing Marginals CoRR Justin Thaler, Jonathan R. Ullman, Salil P. Vadhan
2012	—	`conf`	Faster Algorithms for Privately Releasing Marginals. ICALP (1) Justin Thaler, Jonathan R. Ullman, Salil P. Vadhan
2012	J	`jnl`	On the (im)possibility of obfuscating programs. J. ACM Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
2012	J	`jnl`	Pseudorandomness. Found. Trends Theor. Comput. Sci. Salil P. Vadhan
2012	B	`conf`	Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. TCC Yevgeniy Dodis, Thomas Ristenpart, Salil P. Vadhan
2012	J	`jnl`	Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). SIAM J. Comput. Kousha Etessami, Dieter van Melkebeek, Seth Pettie, John Watrous, Salil P. Vadhan
2012	J	`jnl`	Special issue from RANDOM'09: Editors' Foreword. Comput. Complex. Oded Goldreich, Salil P. Vadhan
2012	J	`jnl`	The Computational Complexity of Nash Equilibria in Concisely Represented Games. ACM Trans. Comput. Theory Grant Schoenebeck, Salil P. Vadhan
2012	A*	`conf`	The Privacy of the Analyst and the Power of the State. FOCS Cynthia Dwork, Moni Naor, Salil P. Vadhan
2011	J	`jnl`	Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. Electron. Colloquium Comput. Complex. Salil P. Vadhan, Colin Jia Zheng
2011	—	`ch.`	Computational Complexity. Encyclopedia of Cryptography and Security (2nd Ed.) Salil P. Vadhan
2011	J	`jnl`	Deterministic extractors for small-space sources. J. Comput. Syst. Sci. Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
2011	J	`jnl`	Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. IACR Cryptol. ePrint Arch. Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
2011	A	`conf`	On Approximating the Entropy of Polynomial Mappings. ICS Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
2011	—	`ch.`	On the Complexity of Computational Problems Regarding Distributions. Studies in Complexity and Cryptography Oded Goldreich, Salil P. Vadhan
2011	J	`jnl`	On the complexity of computational problems regarding distributions (a survey). Electron. Colloquium Comput. Complex. Oded Goldreich, Salil P. Vadhan
2011	B	`conf`	PCPs and the Hardness of Generating Private Synthetic Data. TCC Jonathan R. Ullman, Salil P. Vadhan
2011	A*	`ed.`	Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 STOC Lance Fortnow, Salil P. Vadhan
2011	J	`jnl`	S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2011	—	`ch.`	Simplified Derandomization of BPP Using a Hitting Set Generator. Studies in Complexity and Cryptography Oded Goldreich, Salil P. Vadhan, Avi Wigderson
2011	J	`jnl`	The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2011	A*	`conf`	Time-Lock Puzzles in the Random Oracle Model. CRYPTO Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
2011	J	`jnl`	Truthful Mechanisms for Agents that Value Privacy CoRR Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan
2010	J	`jnl`	A Lower Bound on List Size for List Decoding. IEEE Trans. Inf. Theory Venkatesan Guruswami, Salil P. Vadhan
2010	J	`jnl`	Are PCPs Inherent in Efficient Arguments? Comput. Complex. Guy N. Rothblum, Salil P. Vadhan
2010	A*	`conf`	Boosting and Differential Privacy. FOCS Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
2010	B	`conf`	Composition of Zero-Knowledge Proofs with Efficient Provers. TCC Eleanor Birrell, Salil P. Vadhan
2010	J	`jnl`	Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electron. Colloquium Comput. Complex. Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010	A*	`conf`	Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010	A*	`conf`	Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan
2010	J	`jnl`	Improved Delegation of Computation using Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan
2010	J	`jnl`	On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
2010	J	`jnl`	On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy CoRR Yakir Reshef, Salil P. Vadhan
2010	J	`jnl`	PCPs and the Hardness of Generating Synthetic Data. Electron. Colloquium Comput. Complex. Jonathan R. Ullman, Salil P. Vadhan
2010	A*	`conf`	The Limits of Two-Party Differential Privacy. FOCS Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2010	A*	`conf`	Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2010	J	`jnl`	Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A	`conf`	Are PCPs Inherent in Efficient Arguments? CCC Guy N. Rothblum, Salil P. Vadhan
2009	J	`jnl`	Are PCPs Inherent in Efficient Arguments? Electron. Colloquium Comput. Complex. Guy N. Rothblum, Salil P. Vadhan
2009	J	`jnl`	Composition of Zero-Knowledge Proofs with Efficient Provers. IACR Cryptol. ePrint Arch. Eleanor Birrell, Salil P. Vadhan
2009	A*	`conf`	Computational Differential Privacy. CRYPTO Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan
2009	B	`conf`	Fairness with an Honest Minority and a Rational Majority. TCC Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan
2009	J	`jnl`	Inaccessible Entropy. Electron. Colloquium Comput. Complex. Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A*	`conf`	Inaccessible entropy. STOC Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A*	`conf`	On the complexity of differentially private data release: efficient algorithms and hardness results. STOC Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan
2009	B	`conf`	Proofs of Retrievability via Hardness Amplification. TCC Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
2009	J	`jnl`	Proofs of Retrievability via Hardness Amplification. IACR Cryptol. ePrint Arch. Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
2009	—	`conf`	Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2009	A	`conf`	Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. CCC Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2009	J	`jnl`	Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan
2009	J	`jnl`	Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
2008	B	`conf`	An Equivalence Between Zero Knowledge and Commitments. TCC Shien Jin Ong, Salil P. Vadhan
2008	A*	`conf`	Dense Subsets of Pseudorandom Sets. FOCS Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2008	J	`jnl`	Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2008	J	`jnl`	Fairness with an Honest Minority and a Rational Majority. IACR Cryptol. ePrint Arch. Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan
2008	B	`conf`	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
2008	—	`conf`	Limitations of Hardness vs. Randomness under Uniform Reductions. APPROX-RANDOM Dan Gutfreund, Salil P. Vadhan
2008	J	`jnl`	Limitations of Hardness vs. Randomness under Uniform Reductions. Electron. Colloquium Comput. Complex. Dan Gutfreund, Salil P. Vadhan
2008	J	`jnl`	Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. Electron. Colloquium Comput. Complex. Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2008	J	`jnl`	Simpler Session-Key Generation from Short Random Passwords. J. Cryptol. Minh-Huyen Nguyen, Salil P. Vadhan
2008	—	`conf`	The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
2008	J	`jnl`	The Round Complexity of Two-Party Random Selection. SIAM J. Comput. Saurabh Sanghvi, Salil P. Vadhan
2008	J	`jnl`	Tight Bounds for Hashing Block Sources CoRR Kai-Min Chung, Salil P. Vadhan
2008	—	`conf`	Tight Bounds for Hashing Block Sources. APPROX-RANDOM Kai-Min Chung, Salil P. Vadhan
2008	A*	`conf`	Why simple hash functions work: exploiting the entropy in a data stream. SODA Michael Mitzenmacher, Salil P. Vadhan
2007	A*	`conf`	Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
2007	J	`jnl`	Derandomization in Cryptography. SIAM J. Comput. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
2007	J	`jnl`	Interactive and Noninteractive Zero Knowledge Coincide in the Help Model. IACR Cryptol. ePrint Arch. Dragos Florin Ciocan, Salil P. Vadhan
2007	J	`jnl`	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. IACR Cryptol. ePrint Arch. André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
2007	J	`jnl`	Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Comput. Complex. Luca Trevisan, Salil P. Vadhan
2007	A	`conf`	S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2007	J	`jnl`	S-T Connectivity on Digraphs with a Known Stationary Distribution. Electron. Colloquium Comput. Complex. Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2007	J	`jnl`	Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. Comput. Complex. Oded Goldreich, Salil P. Vadhan
2007	—	`conf`	The Complexity of Zero Knowledge. FSTTCS Salil P. Vadhan
2007	J	`jnl`	The hardness of the Expected Decision Depth problem. Inf. Process. Lett. Dana Ron, Amir Rosenfeld, Salil P. Vadhan
2007	J	`jnl`	The unified theory of pseudorandomness: guest column. SIGACT News Salil P. Vadhan
2007	B	`ed.`	Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings TCC Salil P. Vadhan
2007	A	`conf`	Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. CCC Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
2007	A*	`conf`	Zero Knowledge and Soundness Are Symmetric. EUROCRYPT Shien Jin Ong, Salil P. Vadhan
2006	J	`jnl`	An Unconditional Study of Computational Zero Knowledge. Electron. Colloquium Comput. Complex. Salil P. Vadhan
2006	J	`jnl`	An Unconditional Study of Computational Zero Knowledge. SIAM J. Comput. Salil P. Vadhan
2006	B	`conf`	Concurrent Zero Knowledge Without Complexity Assumptions. TCC Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2006	A*	`conf`	Deterministic extractors for small-space sources. STOC Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
2006	J	`jnl`	Extractors and condensers from univariate polynomials. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
2006	J	`jnl`	Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2006	A*	`conf`	Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC Omer Reingold, Luca Trevisan, Salil P. Vadhan
2006	A*	`conf`	Random Selection with an Adversarial Majority. CRYPTO Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
2006	J	`jnl`	Random Selection with an Adversarial Majority. Electron. Colloquium Comput. Complex. Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
2006	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2006	A*	`conf`	Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. FOCS Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan
2006	J	`jnl`	Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. Electron. Colloquium Comput. Complex. Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan
2006	J	`jnl`	Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. IACR Cryptol. ePrint Arch. Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan
2006	A*	`conf`	The computational complexity of nash equilibria in concisely represented games. EC Grant Schoenebeck, Salil P. Vadhan
2006	J	`jnl`	Using Nondeterminism to Amplify Hardness. SIAM J. Comput. Alexander Healy, Salil P. Vadhan, Emanuele Viola
2006	J	`jnl`	Zero Knowledge and Soundness are Symmetric. Electron. Colloquium Comput. Complex. Shien Jin Ong, Salil P. Vadhan
2006	J	`jnl`	Zero Knowledge and Soundness are Symmetric. IACR Cryptol. ePrint Arch. Shien Jin Ong, Salil P. Vadhan
2006	A*	`conf`	Zero knowledge with efficient provers. STOC Minh-Huyen Nguyen, Salil P. Vadhan
2005	—	`conf`	A Lower Bound on List Size for List Decoding. APPROX-RANDOM Venkatesan Guruswami, Salil P. Vadhan
2005	J	`jnl`	Compression of Samplable Sources Electron. Colloquium Comput. Complex. Luca Trevisan, Salil P. Vadhan, David Zuckerman
2005	J	`jnl`	Compression of Samplable Sources. Comput. Complex. Luca Trevisan, Salil P. Vadhan, David Zuckerman
2005	—	`ch.`	Computational Complexity. Encyclopedia of Cryptography and Security Salil P. Vadhan
2005	J	`jnl`	Concurrent Zero Knowledge without Complexity Assumptions Electron. Colloquium Comput. Complex. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2005	J	`jnl`	Concurrent Zero Knowledge without Complexity Assumptions. IACR Cryptol. ePrint Arch. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2005	J	`jnl`	Derandomization in Cryptography Electron. Colloquium Comput. Complex. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
2005	J	`jnl`	Derandomization in Cryptography. IACR Cryptol. ePrint Arch. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
2005	J	`jnl`	Derandomized Squaring of Graphs Electron. Colloquium Comput. Complex. Eyal Rozenman, Salil P. Vadhan
2005	—	`conf`	Derandomized Squaring of Graphs. APPROX-RANDOM Eyal Rozenman, Salil P. Vadhan
2005	J	`jnl`	Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem Electron. Colloquium Comput. Complex. Omer Reingold, Luca Trevisan, Salil P. Vadhan
2005	A	`conf`	Short PCPs Verifiable in Polylogarithmic Time. CCC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2005	J	`jnl`	The Computational Complexity of Nash Equilibria in Concisely Represented Games Electron. Colloquium Comput. Complex. Grant Schoenebeck, Salil P. Vadhan
2005	J	`jnl`	The Round Complexity of Two-Party Random Selection Electron. Colloquium Comput. Complex. Saurabh Sanghvi, Salil P. Vadhan
2005	A*	`conf`	The round complexity of two-party random selection. STOC Saurabh Sanghvi, Salil P. Vadhan
2004	A*	`conf`	An Unconditional Study of Computational Zero Knowledge. FOCS Salil P. Vadhan
2004	A	`conf`	Compression of Samplable Sources. CCC Luca Trevisan, Salil P. Vadhan, David Zuckerman
2004	J	`jnl`	Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. J. Cryptol. Salil P. Vadhan
2004	J	`jnl`	Lower Bounds for Non-Black-Box Zero Knowledge Electron. Colloquium Comput. Complex. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2004	J	`jnl`	Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptol. ePrint Arch. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2004	B	`conf`	Notions of Reducibility between Cryptographic Primitives. TCC Omer Reingold, Luca Trevisan, Salil P. Vadhan
2004	—	`ch.`	Probabilistic proof systems - Part I. Computational Complexity Theory Salil P. Vadhan
2004	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2004	A*	`conf`	Robust pcps of proximity, shorter pcps and applications to coding. STOC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2004	B	`conf`	Simpler Session-Key Generation from Short Random Passwords. TCC Minh-Huyen Nguyen, Salil P. Vadhan
2004	J	`jnl`	Simpler Session-Key Generation from Short Random Passwords. IACR Cryptol. ePrint Arch. Minh-Huyen Nguyen, Salil P. Vadhan
2004	J	`jnl`	Using Nondeterminism to Amplify Hardness Electron. Colloquium Comput. Complex. Alexander Healy, Salil P. Vadhan, Emanuele Viola
2004	A*	`conf`	Using nondeterminism to amplify hardness. STOC Alexander Healy, Salil P. Vadhan, Emanuele Viola
2003	J	`jnl`	A complete problem for statistical zero knowledge. J. ACM Amit Sahai, Salil P. Vadhan
2003	A*	`conf`	Derandomization in Cryptography. CRYPTO Boaz Barak, Shien Jin Ong, Salil P. Vadhan
2003	A*	`conf`	Extractors: optimal up to constant factors. STOC Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2003	A*	`conf`	Lower Bounds for Non-Black-Box Zero Knowledge. FOCS Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2003	A*	`conf`	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. CRYPTO Salil P. Vadhan
2003	A*	`conf`	Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
2003	A*	`conf`	Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. CRYPTO Daniele Micciancio, Salil P. Vadhan
2002	Misc	`conf`	An Improved Pseudorandom Generator Based on Hardness of Factoring. SCN Nenad Dedic, Leonid Reyzin, Salil P. Vadhan
2002	J	`jnl`	An Improved Pseudorandom Generator Based on Hardness of Factoring. IACR Cryptol. ePrint Arch. Nenad Dedic, Leonid Reyzin, Salil P. Vadhan
2002	J	`jnl`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. Ran Raz, Omer Reingold, Salil P. Vadhan
2002	J	`jnl`	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. IACR Cryptol. ePrint Arch. Salil P. Vadhan
2002	J	`jnl`	On interactive proofs with a laconic prover. Comput. Complex. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
2002	A	`conf`	Pseudorandomness and Average-Case Complexity via Uniform Reductions. CCC Luca Trevisan, Salil P. Vadhan
2002	—	`ed.`	Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings RANDOM José D. P. Rolim, Salil P. Vadhan
2002	A	`conf`	Randomness Conductors and Constant-Degree Lossless Expanders. CCC Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002	A*	`conf`	Randomness Extractors and their Many Guises. FOCS Salil P. Vadhan
2002	A*	`conf`	Randomness conductors and constant-degree lossless expanders. STOC Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002	J	`jnl`	The Power of a Pebble: Exploring and Mapping Directed Graphs. Inf. Comput. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
2001	J	`jnl`	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors Electron. Colloquium Comput. Complex. Omer Reingold, Salil P. Vadhan, Avi Wigderson
2001	J	`jnl`	On Interactive Proofs with a Laconic Prover Electron. Colloquium Comput. Complex. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
2001	A*	`conf`	On Interactive Proofs with a Laconic Prover. ICALP Oded Goldreich, Salil P. Vadhan, Avi Wigderson
2001	J	`jnl`	On the (Im)possibility of Obfuscating Programs Electron. Colloquium Comput. Complex. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
2001	A*	`conf`	On the (Im)possibility of Obfuscating Programs. CRYPTO Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
2001	J	`jnl`	On the (Im)possibility of Obfuscating Programs. IACR Cryptol. ePrint Arch. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
2001	—	`conf`	Order in Pseudorandomness. RANDOM-APPROX Salil P. Vadhan
2001	J	`jnl`	Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
2001	J	`jnl`	The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. Comput. Salil P. Vadhan
2000	J	`jnl`	A Complete Problem for Statistical Zero Knowledge Electron. Colloquium Comput. Complex. Amit Sahai, Salil P. Vadhan
2000	J	`jnl`	A Complete Problem for Statistical Zero Knowledge. IACR Cryptol. ePrint Arch. Amit Sahai, Salil P. Vadhan
2000	A*	`conf`	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS Omer Reingold, Salil P. Vadhan, Avi Wigderson
2000	A*	`conf`	Extracting Randomness from Samplable Distributions. FOCS Luca Trevisan, Salil P. Vadhan
2000	A*	`conf`	On transformation of interactive proofs that preserve the prover's complexity. STOC Salil P. Vadhan
2000	J	`jnl`	Simplified derandomization of BPP using a hitting set generator. Electron. Colloquium Comput. Complex. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
1999	A*	`conf`	Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. CRYPTO Oded Goldreich, Amit Sahai, Salil P. Vadhan
1999	J	`jnl`	Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK Electron. Colloquium Comput. Complex. Oded Goldreich, Amit Sahai, Salil P. Vadhan
1999	A	`conf`	Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. CCC Oded Goldreich, Salil P. Vadhan
1999	A*	`conf`	Error Reduction for Extractors. FOCS Ran Raz, Omer Reingold, Salil P. Vadhan
1999	J	`jnl`	Extracting All the Randomness and Reducing the Error in Trevisan's Extractors Electron. Colloquium Comput. Complex. Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Pseudorandom Generators Without the XOR Lemma (Extended Abstract). STOC Madhu Sudan, Luca Trevisan, Salil P. Vadhan
1999	A	`conf`	Pseudorandom Generators without the XOR Lemma (Abstract). CCC Madhu Sudan, Luca Trevisan, Salil P. Vadhan
1999	A*	`conf`	Verifiable Random Functions. FOCS Silvio Micali, Michael O. Rabin, Salil P. Vadhan
1998	A*	`conf`	Checking Polynomial Identities over any Field: Towards a Derandomization? STOC Daniel Lewin, Salil P. Vadhan
1998	J	`jnl`	Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK Electron. Colloquium Comput. Complex. Oded Goldreich, Salil P. Vadhan
1998	J	`jnl`	Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. IACR Cryptol. ePrint Arch. Oded Goldreich, Salil P. Vadhan
1998	J	`jnl`	Extracting All the Randomness from a Weakly Random Source Electron. Colloquium Comput. Complex. Salil P. Vadhan
1998	A*	`conf`	Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. STOC Oded Goldreich, Amit Sahai, Salil P. Vadhan
1998	A*	`conf`	Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. CRYPTO Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan
1998	J	`jnl`	Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. IACR Cryptol. ePrint Arch. Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan
1998	J	`jnl`	Pseudorandom generators without the XOR Lemma Electron. Colloquium Comput. Complex. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
1998	A*	`conf`	The Power of a Pebble: Exploring and Mapping Directed Graphs. STOC Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
1997	A*	`conf`	A Complete Promise Problem for Statistical Zero-Knowledge. FOCS Amit Sahai, Salil P. Vadhan
1997	—	`conf`	Manipulating statistical difference. Randomization Methods in Algorithm Design Amit Sahai, Salil P. Vadhan