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

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

Verifiable random functions S Micali, M Rabin, S Vadhan 40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999 | 914 | 1999 |

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

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 | 596 | 2000 |

Proofs of retrievability via hardness amplification Y Dodis, S Vadhan, D Wichs Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009 | 555 | 2009 |

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

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 | 524 | 2010 |

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

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 | 479 | 2009 |

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 | 468 | 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 | 356 | 2004 |

The complexity of differential privacy S Vadhan Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich …, 2017 | 333 | 2017 |

The power of a pebble: Exploring and mapping directed graphs MA Bender, A Fernández, D Ron, A Sahai, S Vadhan Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 327 | 1998 |

Notions of reducibility between cryptographic primitives O Reingold, L Trevisan, S Vadhan Theory of Cryptography Conference, 1-20, 2004 | 319 | 2004 |

The complexity of counting in sparse, regular, and planar graphs SP Vadhan SIAM Journal on Computing 31 (2), 398-427, 2001 | 314 | 2001 |

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

Differential privacy: A primer for a non-technical audience A Wood, M Altman, A Bembenek, M Bun, M Gaboardi, J Honaker, ... Vand. J. Ent. & Tech. L. 21, 209, 2018 | 292 | 2018 |

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

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