| On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Annual international cryptology conference, 1-18, 2001 | 1691 | 2001 |
| Boosting and differential privacy C Dwork, GN Rothblum, S Vadhan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 51-60, 2010 | 793 | 2010 |
| Verifiable random functions S Micali, M Rabin, S Vadhan 40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999 | 609 | 1999 |
| 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 | 546 | 2000 |
| Proofs of retrievability via hardness amplification Y Dodis, S Vadhan, D Wichs Theory of Cryptography Conference, 109-127, 2009 | 527 | 2009 |
| Improved delegation of computation using fully homomorphic encryption KM Chung, Y Kalai, S Vadhan Annual Cryptology Conference, 483-501, 2010 | 502 | 2010 |
| Pseudorandomness SP Vadhan Now 7, 1-336, 2012 | 496 | 2012 |
| 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 | 462 | 2012 |
| Pseudorandom generators without the XOR lemma M Sudan, L Trevisan, S Vadhan Journal of Computer and System Sciences 62 (2), 236-266, 2001 | 446 | 2001 |
| 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 | 411 | 2009 |
| 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 | 395 | 2009 |
| Robust PCPs of proximity, shorter PCPs, and applications to coding E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan SIAM Journal on Computing 36 (4), 889-974, 2006 | 318 | 2006 |
| The complexity of counting in sparse, regular, and planar graphs SP Vadhan SIAM Journal on Computing 31 (2), 398-427, 2001 | 295 | 2001 |
| Notions of reducibility between cryptographic primitives O Reingold, L Trevisan, S Vadhan Theory of Cryptography Conference, 1-20, 2004 | 287 | 2004 |
| Computational differential privacy I Mironov, O Pandey, O Reingold, S Vadhan Annual International Cryptology Conference, 126-142, 2009 | 252 | 2009 |
| Extracting all the randomness and reducing the error in Trevisan's extractors R Raz, O Reingold, S Vadhan Journal of Computer and System Sciences 65 (1), 97-128, 2002 | 241 | 2002 |
| 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 | 239 | 2002 |
| Extracting randomness from samplable distributions L Trevisan, S Vadhan Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000 | 220 | 2000 |
| Constructing locally computable extractors and cryptosystems in the bounded-storage model SP Vadhan Journal of Cryptology 17 (1), 43-77, 2004 | 212 | 2004 |
| The complexity of differential privacy S Vadhan Tutorials on the Foundations of Cryptography, 347-450, 2017 | 208 | 2017 |
