Follow
Salil Vadhan
Salil Vadhan
Vicky Joseph Professor of Computer Science and Applied Mathematics, Harvard University
Verified email at g.harvard.edu - Homepage
Title
Cited by
Cited by
Year
On the (im) possibility of obfuscating programs
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ...
Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001
17762001
Boosting and differential privacy
C Dwork, GN Rothblum, S Vadhan
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 51-60, 2010
9082010
Verifiable random functions
S Micali, M Rabin, S Vadhan
40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999
7101999
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
O Reingold, S Vadhan, A Wigderson
Proceedings 41st Annual Symposium on Foundations of Computer Science, 3-13, 2000
5592000
Pseudorandomness
SP Vadhan
Foundations and Trends® in Theoretical Computer Science 7 (1–3), 1-336, 2012
5512012
Proofs of retrievability via hardness amplification
Y Dodis, S Vadhan, D Wichs
Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009
5302009
Improved delegation of computation using fully homomorphic encryption
KM Chung, Y Kalai, S Vadhan
Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010
5042010
On the (im) possibility of obfuscating programs
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ...
Journal of the ACM (JACM) 59 (2), 1-48, 2012
4922012
Pseudorandom generators without the XOR lemma
M Sudan, L Trevisan, S Vadhan
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
4621999
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
V Guruswami, C Umans, S Vadhan
Journal of the ACM (JACM) 56 (4), 1-34, 2009
4272009
On the complexity of differentially private data release: efficient algorithms and hardness results
C Dwork, M Naor, O Reingold, GN Rothblum, S Vadhan
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
4272009
Robust PCPs of proximity, shorter PCPs and applications to coding
E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
3362004
The complexity of counting in sparse, regular, and planar graphs
SP Vadhan
SIAM Journal on Computing 31 (2), 398-427, 2001
3002001
Notions of reducibility between cryptographic primitives
O Reingold, L Trevisan, S Vadhan
Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004 …, 2004
2962004
Computational differential privacy
I Mironov, O Pandey, O Reingold, S Vadhan
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
2752009
The complexity of differential privacy
S Vadhan
Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich …, 2017
2612017
Extracting all the randomness and reducing the error in Trevisan's extractors
R Raz, O Reingold, S Vadhan
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2511999
Randomness conductors and constant-degree lossless expanders
M Capalbo, O Reingold, S Vadhan, A Wigderson
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
2462002
Extracting randomness from samplable distributions
L Trevisan, S Vadhan
Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000
2172000
A complete problem for statistical zero knowledge
A Sahai, S Vadhan
Journal of the ACM (JACM) 50 (2), 196-249, 2003
2082003
The system can't perform the operation now. Try again later.
Articles 1–20