default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalil P. Vadhan
Person information
- affiliation: Harvard University, Cambridge, USA
- award (2009): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. Algorithmica 86(10): 3153-3185 (2024)- [j47]Dean Doron
, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Small-Space Spectral Sparsification via Bounded-Independence Sampling. ACM Trans. Comput. Theory 16(2): 7:1-7:32 (2024) - [c126]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. STOC 2024: 1071-1082 - [i124]Nico Manzonelli, Wanrong Zhang, Salil P. Vadhan:
Membership Inference Attacks and Privacy in Topic Modeling. CoRR abs/2403.04451 (2024) - [i123]Marco Gaboardi, Michael Hay, Salil P. Vadhan:
Programming Frameworks for Differential Privacy. CoRR abs/2403.11088 (2024) - 2023
- [j46]Daniel Alabi, Salil P. Vadhan:
Differentially Private Hypothesis Testing for Linear Regression. J. Mach. Learn. Res. 24: 361:1-361:50 (2023) - [c125]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. APPROX/RANDOM 2023: 44:1-44:22 - [c124]Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang:
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CCS 2023: 1949-1963 - [c123]Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan:
Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CHI 2023: 164:1-164:19 - [c122]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. FOCS 2023: 846-854 - [c121]Salil P. Vadhan, Wanrong Zhang:
Concurrent Composition Theorems for Differential Privacy. STOC 2023: 507-519 - [i122]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. CoRR abs/2301.13541 (2023) - [i121]Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan:
Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CoRR abs/2302.11775 (2023) - [i120]Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi:
On the works of Avi Wigderson. CoRR abs/2307.09524 (2023) - [i119]Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang:
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CoRR abs/2309.05901 (2023) - [i118]Lukman Olagoke, Salil P. Vadhan, Seth Neel:
Black-Box Training Data Identification in GANs via Detector Networks. CoRR abs/2310.12063 (2023) - [i117]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. CoRR abs/2312.17223 (2023) - [i116]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j45]Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan:
Differentially Private Simple Linear Regression. Proc. Priv. Enhancing Technol. 2022(2): 184-204 (2022) - [c120]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. APPROX/RANDOM 2022: 2:1-2:21 - [c119]Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman:
Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CCS 2022: 471-484 - [c118]Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. CCC 2022: 27:1-27:13 - [c117]Daniel Alabi, Salil P. Vadhan:
Hypothesis Testing for Differentially Private Linear Regression. NeurIPS 2022 - [c116]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. SOSA 2022: 57-67 - [i115]Daniel Alabi, Salil P. Vadhan:
Hypothesis Testing for Differentially Private Linear Regression. CoRR abs/2206.14449 (2022) - [i114]Salil P. Vadhan, Wanrong Zhang:
Concurrent Composition Theorems for all Standard Variants of Differential Privacy. CoRR abs/2207.08335 (2022) - [i113]Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman:
Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CoRR abs/2207.10635 (2022) - [i112]Jayshree Sarathy, Salil P. Vadhan:
Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression. CoRR abs/2207.13289 (2022) - [i111]Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - [i110]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j44]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. SIAM J. Comput. 50(6): 1892-1922 (2021) - [j43]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. Theory Comput. 17: 1-35 (2021) - [c115]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM 2021: 58:1-58:21 - [c114]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). CCC 2021: 33:1-33:15 - [c113]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. COCOON 2021: 3-12 - [c112]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS 2021: 7:1-7:20 - [c111]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. TCC (2) 2021: 582-604 - [i109]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - [i108]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. CoRR abs/2105.14427 (2021) - [i107]Jordan Awan, Salil P. Vadhan:
Canonical Noise Distributions and Private Hypothesis Tests. CoRR abs/2108.04303 (2021) - [i106]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. CoRR abs/2111.01997 (2021) - [i105]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i104]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR21 (2021) - [i103]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i102]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. IACR Cryptol. ePrint Arch. 2021: 1196 (2021) - 2020
- [j42]Jonathan R. Ullman, Salil P. Vadhan:
PCPs and the Hardness of Generating Synthetic Data. J. Cryptol. 33(4): 2078-2112 (2020) - [j41]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. ACM Trans. Economics and Comput. 8(2): 9:1-9:37 (2020) - [j40]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020) - [c110]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. FOCS 2020: 1295-1306 - [c109]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. ICALP 2020: 39:1-39:21 - [p7]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms 2020: 567-585 - [i101]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. CoRR abs/2002.11237 (2020) - [i100]Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan:
Differentially Private Simple Linear Regression. CoRR abs/2007.05157 (2020) - [i99]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR abs/2010.05586 (2020) - [i98]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i97]William Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j39]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. J. Priv. Confidentiality 9(2) (2019) - [c108]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. APPROX-RANDOM 2019: 42:1-42:22 - [c107]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying Computational Entropies via Kullback-Leibler Divergence. CRYPTO (2) 2019: 831-858 - [p6]Salil P. Vadhan:
Computational entropy. Providing Sound Foundations for Cryptography 2019: 693-726 - [i96]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. CoRR abs/1902.11202 (2019) - [i95]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. CoRR abs/1903.06361 (2019) - [i94]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. CoRR abs/1912.04524 (2019) - [i93]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. IACR Cryptol. ePrint Arch. 2019: 264 (2019) - 2018
- [j38]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. J. Cryptol. 31(4): 1012-1063 (2018) - [j37]Mark Bun, Jonathan R. Ullman, Salil P. Vadhan:
Fingerprinting Codes and the Price of Approximate Differential Privacy. SIAM J. Comput. 47(5): 1888-1938 (2018) - [j36]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. Theory Comput. 14(1): 1-35 (2018) - [c106]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. CCC 2018: 23:1-23:28 - [c105]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. ITCS 2018: 43:1-43:21 - [c104]Vishesh Karwa, Salil P. Vadhan:
Finite Sample Differentially Private Confidence Intervals. ITCS 2018: 44:1-44:9 - [i92]Jack Murtagh, Kathryn Taylor, George Kellaris, Salil P. Vadhan:
Usable Differential Privacy: A Case Study with PSI. CoRR abs/1809.04103 (2018) - [i91]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j35]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs. Theory Comput. 13(1): 1-50 (2017) - [c103]Salil P. Vadhan:
On Learning vs. Refutation. COLT 2017: 1835-1848 - [c102]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS 2017: 801-812 - [p5]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Tutorials on the Foundations of Cryptography 2017: 159-217 - [p4]Salil P. Vadhan:
The Complexity of Differential Privacy. Tutorials on the Foundations of Cryptography 2017: 347-450 - [i90]Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, Xiaodi Wu:
Computational Notions of Quantum Min-Entropy. CoRR abs/1704.07309 (2017) - [i89]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR abs/1708.04634 (2017) - [i88]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. CoRR abs/1709.05396 (2017) - [i87]Vishesh Karwa, Salil P. Vadhan:
Finite Sample Differentially Private Confidence Intervals. CoRR abs/1711.03908 (2017) - [i86]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j34]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful Mechanisms for Agents That Value Privacy. ACM Trans. Economics and Comput. 4(3): 13:1-13:30 (2016) - [c101]Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan:
Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. ICML 2016: 2111-2120 - [c100]Ryan M. Rogers, Salil P. Vadhan, Aaron Roth, Jonathan R. Ullman:
Privacy Odometers and Filters: Pay-as-you-Go Composition. NIPS 2016: 1921-1929 - [c99]Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Locating a Small Cluster Privately. PODS 2016: 413-427 - [c98]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. TCC (A1) 2016: 157-175 - [c97]Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. TCC (B1) 2016: 607-634 - [i85]Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan:
Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. CoRR abs/1602.03090 (2016) - [i84]Lorrie Faith Cranor, Tal Rabin, Vitaly Shmatikov, Salil P. Vadhan, Daniel J. Weitzner:
Towards a Privacy Research Roadmap for the Computing Community. CoRR abs/1604.03160 (2016) - [i83]Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Locating a Small Cluster Privately. CoRR abs/1604.05590 (2016) - [i82]Ryan M. Rogers, Aaron Roth, Jonathan R. Ullman, Salil P. Vadhan:
Privacy Odometers and Filters: Pay-as-you-Go Composition. CoRR abs/1605.08294 (2016) - [i81]Marco Gaboardi, James Honaker, Gary King, Kobbi Nissim, Jonathan R. Ullman, Salil P. Vadhan:
PSI (Ψ): a Private data Sharing Interface. CoRR abs/1609.04340 (2016) - [i80]Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. IACR Cryptol. ePrint Arch. 2016: 820 (2016) - 2015
- [c96]Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Differentially Private Release and Learning of Threshold Functions. FOCS 2015: 634-649 - [c95]Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan:
Robust Traceability from Trace Amounts. FOCS 2015: 650-669 - [i79]Sitan Chen, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Read-Once, Constant-Depth Circuits. CoRR abs/1504.04675 (2015) - [i78]Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Differentially Private Release and Learning of Threshold Functions. CoRR abs/1504.07553 (2015) - [i77]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. CoRR abs/1507.03113 (2015) - [i76]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. IACR Cryptol. ePrint Arch. 2015: 1057 (2015) - 2014
- [c94]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs. APPROX-RANDOM 2014: 885-899 - [c93]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. ITCS 2014: 81-92 - [c92]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the boundaries on purchasing data from privacy-sensitive individuals. ITCS 2014: 411-422 - [c91]Mark Bun, Jonathan R. Ullman, Salil P. Vadhan:
Fingerprinting codes and the price of approximate differential privacy. STOC 2014: 1-10 - [c90]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. WINE 2014: 371-385 - [i75]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the Boundaries on Purchasing Data from Privacy-Sensitive Individuals. CoRR abs/1401.4092 (2014) - [i74]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs. CoRR abs/1405.7028 (2014) - [i73]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. CoRR abs/1410.1920 (2014) - 2013
- [j33]Yakir Reshef, Salil P. Vadhan:
On extractors and exposure-resilient functions for sublogarithmic entropy. Random Struct. Algorithms 42(3): 386-401 (2013) - [j32]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42(3): 1405-1430 (2013) - [j31]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. 9: 897-945 (2013) - [c89]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM 2013: 655-670 - [c88]Salil P. Vadhan, Colin Jia Zheng:
A Uniform Min-Max Theorem with Applications in Cryptography. CRYPTO (1) 2013: 93-110 - [c87]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. EUROCRYPT 2013: 93-110 - [c86]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Publicly verifiable proofs of sequential work. ITCS 2013: 373-388 - [c85]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful mechanisms for agents that value privacy. EC 2013: 215-232 - [c84]Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson:
Interactive proofs of proximity: delegating computation in sublinear time. STOC 2013: 793-802 - [i72]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR abs/1306.3004 (2013) - [i71]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. CoRR abs/1308.5158 (2013) - [i70]Mark Bun, Jonathan R. Ullman, Salil P. Vadhan:
Fingerprinting Codes and the Price of Approximate Differential Privacy. CoRR abs/1311.3158 (2013) - [i69]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - [i68]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. Electron. Colloquium Comput. Complex. TR13 (2013) - [i67]Colin Jia Zheng, Salil P. Vadhan:
A Uniform Min-Max Theorem with Applications in Cryptography. Electron. Colloquium Comput. Complex. TR13 (2013) - [i66]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. IACR Cryptol. ePrint Arch. 2013: 125 (2013) - [i65]Salil P. Vadhan, Colin Jia Zheng:
A Uniform Min-Max Theorem with Applications in Cryptography. IACR Cryptol. ePrint Arch. 2013: 437 (2013) - 2012
- [j30]Oded Goldreich, Salil P. Vadhan:
Special issue from RANDOM'09: Editors' Foreword. Comput. Complex. 21(1): 1 (2012) - [j29]Salil P. Vadhan:
Pseudorandomness. Found. Trends Theor. Comput. Sci. 7(1-3): 1-336 (2012) - [j28]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (im)possibility of obfuscating programs. J. ACM 59(2): 6:1-6:48 (2012) - [j27]Kousha Etessami, Dieter van Melkebeek, Seth Pettie, John Watrous, Salil P. Vadhan:
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). SIAM J. Comput. 41(5): 1233-1234 (2012) - [j26]Grant Schoenebeck, Salil P. Vadhan:
The Computational Complexity of Nash Equilibria in Concisely Represented Games. ACM Trans. Comput. Theory 4(2): 4:1-4:50 (2012) - [c83]Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan:
Differential Privacy with Imperfect Randomness. CRYPTO 2012: 497-516 - [c82]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS 2012: 120-129 - [c81]Cynthia Dwork, Moni Naor, Salil P. Vadhan:
The Privacy of the Analyst and the Power of the State. FOCS 2012: 400-409 - [c80]Justin Thaler, Jonathan R. Ullman, Salil P. Vadhan:
Faster Algorithms for Privately Releasing Marginals. ICALP (1) 2012: 810-821 - [c79]Salil P. Vadhan, Colin Jia Zheng:
Characterizing pseudoentropy. ITW 2012: 104-108 - [c78]Salil P. Vadhan, Colin Jia Zheng:
Characterizing pseudoentropy and simplifying pseudorandom generator constructions. STOC 2012: 817-836 - [c77]Yevgeniy Dodis, Thomas Ristenpart, Salil P. Vadhan:
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. TCC 2012: 618-635 - [i64]Justin Thaler, Jonathan R. Ullman, Salil P. Vadhan:
Faster Algorithms for Privately Releasing Marginals. CoRR abs/1205.1758 (2012) - [i63]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. CoRR abs/1210.0049 (2012) - [i62]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i61]Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan:
Differential Privacy with Imperfect Randomness. IACR Cryptol. ePrint Arch. 2012: 435 (2012) - 2011
- [j25]Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman:
Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77(1): 191-220 (2011) - [j24]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3): 30:1-30:21 (2011) - [c76]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Time-Lock Puzzles in the Random Oracle Model. CRYPTO 2011: 39-50 - [c75]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475 - [c74]Jonathan R. Ullman, Salil P. Vadhan:
PCPs and the Hardness of Generating Private Synthetic Data. TCC 2011: 400-416 - [p3]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
Simplified Derandomization of BPP Using a Hitting Set Generator. Studies in Complexity and Cryptography 2011: 59-67 - [p2]Oded Goldreich, Salil P. Vadhan:
On the Complexity of Computational Problems Regarding Distributions. Studies in Complexity and Cryptography 2011: 390-405 - [e3]Lance Fortnow, Salil P. Vadhan:
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. ACM 2011, ISBN 978-1-4503-0691-1 [contents] - [r2]Salil P. Vadhan:
Computational Complexity. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 235-240 - [i60]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful Mechanisms for Agents that Value Privacy. CoRR abs/1111.5472 (2011) - [i59]Oded Goldreich, Salil P. Vadhan:
On the complexity of computational problems regarding distributions (a survey). Electron. Colloquium Comput. Complex. TR11 (2011) - [i58]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR11 (2011) - [i57]Salil P. Vadhan, Colin Jia Zheng:
Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. Electron. Colloquium Comput. Complex. TR11 (2011) - [i56]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2011: 553 (2011) - 2010
- [j23]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? Comput. Complex. 19(2): 265-304 (2010) - [j22]Venkatesan Guruswami, Salil P. Vadhan:
A Lower Bound on List Size for List Decoding. IEEE Trans. Inf. Theory 56(11): 5681-5688 (2010) - [c73]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO 2010: 483-501 - [c72]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [c71]Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan:
Boosting and Differential Privacy. FOCS 2010: 51-60 - [c70]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90 - [c69]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446 - [c68]Eleanor Birrell, Salil P. Vadhan:
Composition of Zero-Knowledge Proofs with Efficient Provers. TCC 2010: 572-587 - [i55]Yakir Reshef, Salil P. Vadhan:
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy. CoRR abs/1003.4029 (2010) - [i54]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. TR10 (2010) - [i53]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electron. Colloquium Comput. Complex. TR10 (2010) - [i52]Jonathan R. Ullman, Salil P. Vadhan:
PCPs and the Hardness of Generating Synthetic Data. Electron. Colloquium Comput. Complex. TR10 (2010) - [i51]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010: 120 (2010) - [i50]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation using Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010: 241 (2010)
2000 – 2009
- 2009
- [j21]Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan:
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4): 20:1-20:34 (2009) - [j20]Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan:
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009) - [c67]Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630 - [c66]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? CCC 2009: 81-92 - [c65]Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. CCC 2009: 126-136 - [c64]Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan:
Computational Differential Privacy. CRYPTO 2009: 126-142 - [c63]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan:
On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390 - [c62]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible entropy. STOC 2009: 611-620 - [c61]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53 - [c60]Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. TCC 2009: 109-127 - [i49]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electron. Colloquium Comput. Complex. TR09 (2009) - [i48]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? Electron. Colloquium Comput. Complex. TR09 (2009) - [i47]Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. IACR Cryptol. ePrint Arch. 2009: 41 (2009) - [i46]Eleanor Birrell, Salil P. Vadhan:
Composition of Zero-Knowledge Proofs with Efficient Provers. IACR Cryptol. ePrint Arch. 2009: 604 (2009) - 2008
- [j19]Minh-Huyen Nguyen, Salil P. Vadhan:
Simpler Session-Key Generation from Short Random Passwords. J. Cryptol. 21(1): 52-96 (2008) - [j18]Saurabh Sanghvi, Salil P. Vadhan:
The Round Complexity of Two-Party Random Selection. SIAM J. Comput. 38(2): 523-550 (2008) - [c59]Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan:
The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM 2008: 331-342 - [c58]Kai-Min Chung, Salil P. Vadhan:
Tight Bounds for Hashing Block Sources. APPROX-RANDOM 2008: 357-370 - [c57]Dan Gutfreund, Salil P. Vadhan:
Limitations of Hardness vs. Randomness under Uniform Reductions. APPROX-RANDOM 2008: 469-482 - [c56]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85 - [c55]Michael Mitzenmacher, Salil P. Vadhan:
Why simple hash functions work: exploiting the entropy in a data stream. SODA 2008: 746-755 - [c54]Shien Jin Ong, Salil P. Vadhan:
An Equivalence Between Zero Knowledge and Commitments. TCC 2008: 482-500 - [c53]André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC 2008: 501-534 - [i45]Kai-Min Chung, Salil P. Vadhan:
Tight Bounds for Hashing Block Sources. CoRR abs/0806.1948 (2008) - [i44]Dan Gutfreund, Salil P. Vadhan:
Limitations of Hardness vs. Randomness under Uniform Reductions. Electron. Colloquium Comput. Complex. TR08 (2008) - [i43]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. TR08 (2008) - [i42]Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. Electron. Colloquium Comput. Complex. TR08 (2008) - [i41]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. IACR Cryptol. ePrint Arch. 2008: 97 (2008) - 2007
- [j17]Oded Goldreich, Salil P. Vadhan:
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. Comput. Complex. 16(4): 325-330 (2007) - [j16]Luca Trevisan, Salil P. Vadhan:
Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Comput. Complex. 16(4): 331-364 (2007) - [j15]Dana Ron, Amir Rosenfeld, Salil P. Vadhan:
The hardness of the Expected Decision Depth problem. Inf. Process. Lett. 101(3): 112-118 (2007) - [j14]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. SIAM J. Comput. 37(2): 380-400 (2007) - [j13]Salil P. Vadhan:
The unified theory of pseudorandomness: guest column. SIGACT News 38(3): 39-54 (2007) - [c52]Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan:
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. CCC 2007: 96-108 - [c51]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC 2007: 236-249 - [c50]Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283 - [c49]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness Are Symmetric. EUROCRYPT 2007: 187-209 - [c48]Salil P. Vadhan:
The Complexity of Zero Knowledge. FSTTCS 2007: 52-70 - [e2]Salil P. Vadhan:
Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings. Lecture Notes in Computer Science 4392, Springer 2007, ISBN 3-540-70935-5 [contents] - [i40]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. Electron. Colloquium Comput. Complex. TR07 (2007) - [i39]Dragos Florin Ciocan, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge Coincide in the Help Model. IACR Cryptol. ePrint Arch. 2007: 389 (2007) - [i38]André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. IACR Cryptol. ePrint Arch. 2007: 467 (2007) - 2006
- [j12]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006) - [j11]Alexander Healy, Salil P. Vadhan, Emanuele Viola:
Using Nondeterminism to Amplify Hardness. SIAM J. Comput. 35(4): 903-931 (2006) - [j10]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. 36(4): 889-974 (2006) - [j9]Salil P. Vadhan:
An Unconditional Study of Computational Zero Knowledge. SIAM J. Comput. 36(4): 1160-1214 (2006) - [c47]Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
Random Selection with an Adversarial Majority. CRYPTO 2006: 409-426 - [c46]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. FOCS 2006: 3-14 - [c45]Grant Schoenebeck, Salil P. Vadhan:
The computational complexity of nash equilibria in concisely represented games. EC 2006: 270-279 - [c44]Minh-Huyen Nguyen, Salil P. Vadhan:
Zero knowledge with efficient provers. STOC 2006: 287-295 - [c43]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466 - [c42]Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman:
Deterministic extractors for small-space sources. STOC 2006: 691-700 - [c41]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge Without Complexity Assumptions. TCC 2006: 1-20 - [i37]Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
Random Selection with an Adversarial Majority. Electron. Colloquium Comput. Complex. TR06 (2006) - [i36]Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan:
Extractors and condensers from univariate polynomials. Electron. Colloquium Comput. Complex. TR06 (2006) - [i35]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. Electron. Colloquium Comput. Complex. TR06 (2006) - [i34]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness are Symmetric. Electron. Colloquium Comput. Complex. TR06 (2006) - [i33]Salil P. Vadhan:
An Unconditional Study of Computational Zero Knowledge. Electron. Colloquium Comput. Complex. TR06 (2006) - [i32]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. IACR Cryptol. ePrint Arch. 2006: 185 (2006) - [i31]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness are Symmetric. IACR Cryptol. ePrint Arch. 2006: 414 (2006) - 2005
- [j8]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. Comput. Complex. 14(3): 186-227 (2005) - [c40]Venkatesan Guruswami, Salil P. Vadhan:
A Lower Bound on List Size for List Decoding. APPROX-RANDOM 2005: 318-329 - [c39]Eyal Rozenman, Salil P. Vadhan:
Derandomized Squaring of Graphs. APPROX-RANDOM 2005: 436-447 - [c38]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Short PCPs Verifiable in Polylogarithmic Time. CCC 2005: 120-134 - [c37]Saurabh Sanghvi, Salil P. Vadhan:
The round complexity of two-party random selection. STOC 2005: 338-347 - [r1]Salil P. Vadhan:
Computational Complexity. Encyclopedia of Cryptography and Security 2005 - [i30]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. Electron. Colloquium Comput. Complex. TR05 (2005) - [i29]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electron. Colloquium Comput. Complex. TR05 (2005) - [i28]Grant Schoenebeck, Salil P. Vadhan:
The Computational Complexity of Nash Equilibria in Concisely Represented Games. Electron. Colloquium Comput. Complex. TR05 (2005) - [i27]Eyal Rozenman, Salil P. Vadhan:
Derandomized Squaring of Graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - [i26]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge without Complexity Assumptions. Electron. Colloquium Comput. Complex. TR05 (2005) - [i25]Saurabh Sanghvi, Salil P. Vadhan:
The Round Complexity of Two-Party Random Selection. Electron. Colloquium Comput. Complex. TR05 (2005) - [i24]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. Electron. Colloquium Comput. Complex. TR05 (2005) - [i23]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge without Complexity Assumptions. IACR Cryptol. ePrint Arch. 2005: 286 (2005) - [i22]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. IACR Cryptol. ePrint Arch. 2005: 365 (2005) - 2004
- [j7]Salil P. Vadhan:
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. J. Cryptol. 17(1): 43-77 (2004) - [c36]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. CCC 2004: 1-14 - [c35]Salil P. Vadhan:
An Unconditional Study of Computational Zero Knowledge. FOCS 2004: 176-185 - [c34]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust pcps of proximity, shorter pcps and applications to coding. STOC 2004: 1-10 - [c33]Alexander Healy, Salil P. Vadhan, Emanuele Viola:
Using nondeterminism to amplify hardness. STOC 2004: 192-201 - [c32]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20 - [c31]Minh-Huyen Nguyen, Salil P. Vadhan:
Simpler Session-Key Generation from Short Random Passwords. TCC 2004: 428-445 - [p1]Salil P. Vadhan:
Probabilistic proof systems - Part I. Computational Complexity Theory 2004: 315-348 - [i21]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. Electron. Colloquium Comput. Complex. TR04 (2004) - [i20]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. Electron. Colloquium Comput. Complex. TR04 (2004) - [i19]Alexander Healy, Salil P. Vadhan, Emanuele Viola:
Using Nondeterminism to Amplify Hardness. Electron. Colloquium Comput. Complex. TR04 (2004) - [i18]Minh-Huyen Nguyen, Salil P. Vadhan:
Simpler Session-Key Generation from Short Random Passwords. IACR Cryptol. ePrint Arch. 2004: 182 (2004) - [i17]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptol. ePrint Arch. 2004: 226 (2004) - 2003
- [j6]Amit Sahai, Salil P. Vadhan:
A complete problem for statistical zero knowledge. J. ACM 50(2): 196-249 (2003) - [c30]Salil P. Vadhan:
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. CRYPTO 2003: 61-77 - [c29]Daniele Micciancio, Salil P. Vadhan:
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. CRYPTO 2003: 282-298 - [c28]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. CRYPTO 2003: 299-315 - [c27]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393 - [c26]Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Extractors: optimal up to constant factors. STOC 2003: 602-611 - [c25]Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson:
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC 2003: 612-621 - 2002
- [j5]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On interactive proofs with a laconic prover. Comput. Complex. 11(1-2): 1-53 (2002) - [j4]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. Inf. Comput. 176(1): 1-21 (2002) - [j3]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. 65(1): 97-128 (2002) - [c24]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders. CCC 2002: 15 - [c23]Luca Trevisan, Salil P. Vadhan:
Pseudorandomness and Average-Case Complexity via Uniform Reductions. CCC 2002: 129-138 - [c22]Salil P. Vadhan:
Randomness Extractors and their Many Guises. FOCS 2002: 9- - [c21]Nenad Dedic, Leonid Reyzin, Salil P. Vadhan:
An Improved Pseudorandom Generator Based on Hardness of Factoring. SCN 2002: 88-101 - [c20]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668 - [e1]José D. P. Rolim, Salil P. Vadhan:
Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Lecture Notes in Computer Science 2483, Springer 2002, ISBN 3-540-44147-6 [contents] - [i16]Nenad Dedic, Leonid Reyzin, Salil P. Vadhan:
An Improved Pseudorandom Generator Based on Hardness of Factoring. IACR Cryptol. ePrint Arch. 2002: 131 (2002) - [i15]Salil P. Vadhan:
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. IACR Cryptol. ePrint Arch. 2002: 162 (2002) - 2001
- [j2]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci. 62(2): 236-266 (2001) - [j1]Salil P. Vadhan:
The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. Comput. 31(2): 398-427 (2001) - [c19]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. CRYPTO 2001: 1-18 - [c18]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On Interactive Proofs with a Laconic Prover. ICALP 2001: 334-345 - [c17]Salil P. Vadhan:
Order in Pseudorandomness. RANDOM-APPROX 2001: 10-11 - [i14]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Electron. Colloquium Comput. Complex. TR01 (2001) - [i13]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On Interactive Proofs with a Laconic Prover. Electron. Colloquium Comput. Complex. TR01 (2001) - [i12]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. Electron. Colloquium Comput. Complex. TR01 (2001) - [i11]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. IACR Cryptol. ePrint Arch. 2001: 69 (2001) - 2000
- [c16]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS 2000: 3-13 - [c15]Luca Trevisan, Salil P. Vadhan:
Extracting Randomness from Samplable Distributions. FOCS 2000: 32-42 - [c14]Salil P. Vadhan:
On transformation of interactive proofs that preserve the prover's complexity. STOC 2000: 200-207 - [i10]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
Simplified derandomization of BPP using a hitting set generator. Electron. Colloquium Comput. Complex. TR00 (2000) - [i9]Amit Sahai, Salil P. Vadhan:
A Complete Problem for Statistical Zero Knowledge. Electron. Colloquium Comput. Complex. TR00 (2000) - [i8]Amit Sahai, Salil P. Vadhan:
A Complete Problem for Statistical Zero Knowledge. IACR Cryptol. ePrint Arch. 2000: 56 (2000)
1990 – 1999
- 1999
- [c13]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators without the XOR Lemma (Abstract). CCC 1999: 4 - [c12]Oded Goldreich, Salil P. Vadhan:
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. CCC 1999: 54- - [c11]Oded Goldreich, Amit Sahai, Salil P. Vadhan:
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. CRYPTO 1999: 467-484 - [c10]Silvio Micali, Michael O. Rabin, Salil P. Vadhan:
Verifiable Random Functions. FOCS 1999: 120-130 - [c9]Ran Raz, Omer Reingold, Salil P. Vadhan:
Error Reduction for Extractors. FOCS 1999: 191-201 - [c8]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC 1999: 149-158 - [c7]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators Without the XOR Lemma (Extended Abstract). STOC 1999: 537-546 - [i7]Oded Goldreich, Amit Sahai, Salil P. Vadhan:
Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK. Electron. Colloquium Comput. Complex. TR99 (1999) - [i6]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting All the Randomness and Reducing the Error in Trevisan's Extractors. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [c6]Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan:
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. CRYPTO 1998: 283-298 - [c5]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. STOC 1998: 269-278 - [c4]Oded Goldreich, Amit Sahai, Salil P. Vadhan:
Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. STOC 1998: 399-408 - [c3]Daniel Lewin, Salil P. Vadhan:
Checking Polynomial Identities over any Field: Towards a Derandomization? STOC 1998: 438-447 - [i5]Salil P. Vadhan:
Extracting All the Randomness from a Weakly Random Source. Electron. Colloquium Comput. Complex. TR98 (1998) - [i4]Oded Goldreich, Salil P. Vadhan:
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. Electron. Colloquium Comput. Complex. TR98 (1998) - [i3]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom generators without the XOR Lemma. Electron. Colloquium Comput. Complex. TR98 (1998) - [i2]Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan:
Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. IACR Cryptol. ePrint Arch. 1998: 19 (1998) - [i1]Oded Goldreich, Salil P. Vadhan:
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. IACR Cryptol. ePrint Arch. 1998: 26 (1998) - 1997
- [c2]Amit Sahai, Salil P. Vadhan:
Manipulating statistical difference. Randomization Methods in Algorithm Design 1997: 251-270 - [c1]Amit Sahai, Salil P. Vadhan:
A Complete Promise Problem for Statistical Zero-Knowledge. FOCS 1997: 448-457
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
