Vicky Joseph Professor of Computer Science and Applied Mathematics, SEAS, Harvard
Area Chair for Computer Science

Salil Vadhan is the lead PI of Privacy Tools for Sharing Research Data project and the Vicky Joseph Professor of Computer Science and Applied Mathematics. His research areas include computational complexity, cryptography, randomness in computation, and data privacy.

Publications

2016

M. Altman, A. Wood, D. O'Brien, S. Vadhan, and U. Gasser, “Towards a Modern Approach to Privacy-Aware Government Data Releases,” Berkeley Journal of Technology Law, Forthcoming.

J. Murtagh and S. Vadhan, “The Complexity of Computing the Optimal Composition of Differential Privacy,” in Theory of Cryptography Conference (TCC 2016), 2016. ArXiv Version

2015

C. Dwork, A. Smith, T. Steinke, J. Ullman, and S. Vadhan, “Robust Traceability from Trace Amounts,” in IEEE Symposium on Foundations of Computer Science (FOCS 2015), Berkeley, California, 2015.

M. Bun, K. Nissim, U. Stemmer, and S. Vadhan, “Differentially Private Release and Learning of Threshold Functions,” in 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 15), Berkeley, California, 2015. ArXiv VersionAbstract

L. Cranor, T. Rabin, V. Shmatikov, S. Vadhan, and D. Weitzner, “Towards a Privacy Research Roadmap for the Computing Community.,” Report for the Computing Community Consortium (CCC), 2015. CCC Version

D. O'Brien, et al., “Integrating Approaches to Privacy Across the Research Lifecycle: When is Information Purely Public?,” Social Science Research Network, 2015. SSRN Version

2014

Y. Chen, O. Sheffet, and S. Vadhan, “Privacy Games,” in 10th Conference on Web and Internet Economics (WINE), Beijing, China, 2014.

A. Wood, et al.,Integrating Approaches to Privacy Across the Research Lifecycle: Long-Term Longitudinal Studies. Cambridge: Harvard University, 2014. Publisher's VersionAbstract

M. Bun, J. Ullman, and S. Vadhan, “Fingerprinting Codes and the Price of Approximate Differential Privacy,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA, 2014, pp. 1–10. Publisher's Version

K. Nissim, S. Vadhan, and D. Xiao, “Redrawing the Boundaries on Purchasing Data from Privacy-sensitive Individuals,” in Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, New York, NY, USA, 2014, pp. 411–422. Publisher's Version

M. Altman, D. O’Brien, S. Vadhan, and A. Wood, “Comment to The White House Office of Science and Technology Policy (OSTP): Big Data Study, Request for Information”. 2014.Abstract

M. Altman, D. O’Brien, S. Vadhan, and A. Wood, “Comment on the Occupational Safety and Health Administration (OSHA) Proposed Rule: Improve Tracking of Workplace Injuries and Illnesses; Extension of Comment Period”. 2014. Full Text at Regulations.gov

2013

G. N. Rothblum, S. Vadhan, and A. Wigderson, “Interactive proofs of proximity: delegating computation in sublinear time,” in Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Palo Alto, California, USA, 2013, pp. 793-802. DOIAbstract

2012

J. Thaler, J. Ullman, and S. P. Vadhan, “Faster Algorithms for Privately Releasing Marginals,” in Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, Lecture Notes in Computer Science., vol. 7391. DOI:10.1007/978-3-642-31594-7_68Abstract
C. Dwork, M. Naor, and S. Vadhan, “The Privacy of the Analyst and the Power of the State,” in Proceedings of the 53rd Annual {IEEE} Symposium on Foundations of Computer Science (FOCS 12), New Brunswick, NJ, 2012, pp. 400–409. IEEE XploreAbstract

Y. Dodis, A. López-Alt, I. Mironov, and S. Vadhan, “Differential Privacy with Imperfect Randomness,” in Proceedings of the 32nd International Cryptology Conference (CRYPTO 12), Santa Barbara, CA, 2012, Lecture Notes on Computer Science., vol. 7417, pp. 497–516. Springer LinkAbstract

2011

Y. Chen, S. Chong, I. A. Kash, T. Moran, and S. P. Vadhan, “Truthful Mechanisms for Agents that Value Privacy,” CoRR, vol. abs/1111.5472, 2011. arXiv:abs/1111.5472Abstract

J. Ullman and S. Vadhan, “PCPs and the Hardness of Generating Synthetic Data,” in Proceedings of the 8th IACR Theory of Cryptography Conference (TCC 11), Providence, RI, 2011, Lecture Notes on Computer Science., vol. 5978, pp. 572–587. Springer LinkAbstract

2009

C. Dwork, M. Naor, O. Reingold, G. Rothblum, and S. Vadhan, “On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 09), Bethesda, MD, 2009, pp. 381–390. ACM Digital LibraryAbstract

I. Mironov, O. Pandey, O. Reingold, and S. Vadhan, “Computational Differential Privacy,” in Advances in Cryptology–-CRYPTO `09, Santa Barbara, CA, 2009, vol. 5677, pp. 126–142. Springer LinkAbstract