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 | 1728 | 2001 |

Boosting and differential privacy C Dwork, GN Rothblum, S Vadhan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 51-60, 2010 | 844 | 2010 |

Verifiable random functions S Micali, M Rabin, S Vadhan 40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999 | 662 | 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 | 554 | 2000 |

Proofs of retrievability via hardness amplification Y Dodis, S Vadhan, D Wichs Theory of Cryptography Conference, 109-127, 2009 | 533 | 2009 |

Pseudorandomness SP Vadhan Foundations and Trends® in Theoretical Computer Science 7 (1–3), 1-336, 2012 | 528 | 2012 |

Improved delegation of computation using fully homomorphic encryption KM Chung, Y Kalai, S Vadhan Annual Cryptology Conference, 483-501, 2010 | 502 | 2010 |

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 | 480 | 2012 |

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 | 457 | 1999 |

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 | 424 | 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 | 413 | 2009 |

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 | 335 | 2004 |

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 | 294 | 2004 |

Computational differential privacy I Mironov, O Pandey, O Reingold, S Vadhan Annual International Cryptology Conference, 126-142, 2009 | 266 | 2009 |

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 | 249 | 1999 |

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 | 246 | 2002 |

The complexity of differential privacy S Vadhan Tutorials on the Foundations of Cryptography, 347-450, 2017 | 238 | 2017 |

Extracting randomness from samplable distributions L Trevisan, S Vadhan Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000 | 221 | 2000 |

Constructing locally computable extractors and cryptosystems in the bounded-storage model SP Vadhan Journal of Cryptology 17 (1), 43-77, 2004 | 217 | 2004 |