views: 1409

# Salil P. Vadhan

Professor

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Sign in to view more

Education

Sign in to view more

Bio

Salil Vadhan is the Vicky Joseph Professor of Computer Science and Applied Mathematics at the Harvard John A. Paulson School of Engineering & Applied Sciences, and Lead PI on the Harvard Privacy Tools Project. Vadhan’s research in theoretical computer science spans computational complexity, cryptography, and data privacy. His honors include a Harvard College Professorship, a Simons Investigator Award, and a Guggenheim Fellowship.

## Papers180 papers

Sort

By YearBy Citation

ACM Transactions on Economics and Computation, no. 2 (2020): 1-37

international cryptology conference, (2019): 264-858

international workshop and international workshop on approximation, randomization, and combinatorial..., (2019)

arXiv: Human-Computer Interaction, (2018)

conference on innovations in theoretical computer science, (2018)

Kobbi Nissim, Aaron Bembenek, Alexandra Wood,Mark Bun,Marco Gaboardi,Urs Gasser, David O'Brien,Salil P. Vadhan

Harvard Journal of Law & Technology, (2018)

Bibtex

CCC, (2018): 23:1-23:28

J. Cryptology, no. 4 (2018): 1012-1063

arXiv: Cryptography and Security, (2017)

Theory of Computing, no. 1 (2017): 1-50

Electronic Colloquium on Computational Complexity (ECCC), (2017)

FOCS, (2017): 801-812

Tutorials on the Foundations of Cryptography, pp.347-450, (2017)

Berkeley Technology Law Journal, no. 2 (2016): 1899

Bibtex

ICML, pp.2111-2120, (2016)

NIPS, (2016)

arXiv: Cryptography and Security, (2016)

international conference on machine learning, (2016): 2111-2120

ACM Trans. Economics and Comput., no. 3 (2016)

PODS, (2016)

IACR Cryptology ePrint Archive, (2016)

NIPS, pp.1921-1929, (2016)

arXiv: Computers and Society, (2016)

IEEE Symposium on Foundations of Computer Science, (2015)

Urs Gasser, David O Brien,Jonathan Ullman, Micah Altman, Michael Barsinai,Kobbi Nissim,Salil P Vadhan, Michael John Wojcik, Alexandra B Wood

(2015)

Bibtex

IEEE Symposium on Foundations of Computer Science, (2015)

STOC, (2014): 1-10

A uniform min-max theorem and characterizations of computational randomness, (2014)

EIBibtex

Proceedings of the 5th conference on Innovations in theoretical computer science, (2014)

APPROX-RANDOM, (2014): 885-899

ITCS, pp.373-388, (2013)

Clinical Orthopaedics and Related Research, (2013): 386-401

IACR Cryptology ePrint Archive, (2013): 93-110

APPROX-RANDOM, (2013): 655-670

EC '13: ACM Conference on Electronic Commerce
Philadelphia
Pennsylvania
USA
..., pp.215-232, (2013)

CRYPTO, (2013): 93-110

STOC, (2013)

Electronic Colloquium on Computational Complexity (ECCC), (2013): 101

Theory of Computing, no. 1 (2013): 897-945

Electronic Colloquium on Computational Complexity (ECCC), (2013): 81-92

Electronic Colloquium on Computational Complexity (ECCC), no. 2 (2012): ArticleNo.6-ArticleNo.6

Electronic Colloquium on Computational Complexity (ECCC), (2012): 817-836

SIAM J. Comput., no. 5 (2012): 1233-1234

Electronic Colloquium on Computational Complexity (ECCC), (2012): 120-129

Foundations and Trends in Theoretical Computer Science, no. 1-3 (2012): 1-336

ITW, pp.104-108, (2012)

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Pro..., (2012)

TCC, pp.618-635, (2012)

Computational Complexity, no. 1 (2012): 1-1

IACR Cryptology ePrint Archive, (2012): 497-516

Electronic Colloquium on Computational Complexity (ECCC), (2011)

CRYPTO, pp.39-50, (2011)

IEEE Conference on Computational Complexity, no. 3 (2011): ArticleNo.30-ArticleNo.30

TCC, pp.400-416, (2011)

J. Comput. Syst. Sci., no. 1 (2011): 191-220

Electronic Colloquium on Computational Complexity (ECCC), (2011): 81-90

Studies in complexity and cryptography, pp.59-67, (2011)

Studies in complexity and cryptography, pp.390-405, (2011)

(2011)

Cited by

**6**BibtexEfficient parallel repetition theorems with applications to security amplification, (2011)

Cited by

**1**EIBibtexIACR Cryptology ePrint Archive, (2011): 553

Symposium on Theory of Computing Conference (Co-located with FCRC 2011), (2011)

Cited by

**88**EIBibtexI4CS, (2011): 460-475

(2011)

Cited by

**5**BibtexIACR Cryptology ePrint Archive, (2010): 616-637

Computational Complexity - Selected papers from the 24th Annual IEEE Conference on Computational Com..., no. 2 (2010): 265-304

FOCS, pp.51-60, (2010)

SIAM Journal on Computing, (2010): 437-446

IACR Cryptology ePrint Archive, (2010): 572-587

Electronic Colloquium on Computational Complexity (ECCC), (2010)

IACR Cryptology ePrint Archive, (2010): 483-501

STOC, (2009): 611-620

APPROX-RANDOM, pp.615-630, (2009)

IEEE Conference on Computational Complexity, no. 4 (2009): 96-108

STOC, pp.381-390, (2009)

SIAM J. Comput., no. 3 (2009): 1153-1218

CRYPTO, (2009): 126-142

TCC, (2009): 36-53

IEEE Conference on Computational Complexity, no. 103 (2009): 126-136

IACR Cryptology ePrint Archive, (2009): 109-127

Symposium on Discrete Algorithms, pp.746-755, (2008)

Electronic Colloquium on Computational Complexity (ECCC), no. 007 (2008): 469-482

TCC, pp.482-500, (2008)

Electronic Colloquium on Computational Complexity (ECCC), no. 045 (2008): 76-85

TCC, (2008): 501-534

Clinical Orthopaedics and Related Research, (2008): 357-370

APPROX-RANDOM, pp.331-342, (2008)

SIAM J. Comput., no. 2 (2008): 523-550

Siam Journal on Computing, no. 2 (2007): 380-400

Computational Complexity, no. 4 (2007): 103-112

International Crytology Conference, pp.264-283, (2007)

Inf. Process. Lett., no. 3 (2007): 112-118

SIGACT News, no. 3 (2007): 39-54

Unconditional relationships within zero knowledge, (2007)

Cited by

**3**EIBibtexView All