# Publications

Privacy Integrated Data Stream Queries.” In Proceedings of the 2014 International Workshop on Privacy & Security in Programming (PSP '14). New York, NY: ACM. ACM Digital Library Version

. 2014. “Private Empirical Risk Minimization, Revisited.” In ICML 2014 Workshop on Learning, Security and Privacy. Beijing, China. Publisher's VersionAbstract PDF

. 2014. “Privately Solving Linear Programs.” In Automata, Languages, and Programming, 8572: Pp. 612-624. Springer Berlin Heidelberg. Publisher's Version PDF

. 2014. “Redrawing the Boundaries on Purchasing Data from Privacy-sensitive Individuals.” In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, Pp. 411–422. New York, NY, USA: ACM. Publisher's Version PDF

. 2014. “Sample Complexity Bounds on Differentially Private Learning via Communication Complexity.” Proceedings of The 27th Conference on Learning Theory (COLT 2014) 35, Pp. 1-20. Barcelona, Spain: JMLR Workshop and Conference Proceedings. Publisher's VersionAbstract PDF

. 2014. “ . 2014. What Stays in Vegas: The World of Personal Data -- Lifeblood of Big Business -- and the End of Privacy as We Know It., Pp. 336. New York, NY: Public Affairs. Available on AmazonAbstract

Analyzing Graphs with Node Differential Privacy.” In Theory of Cryptography, 7785: Pp. 457-476. Springer Berlin Heidelberg. Springer LinkAbstract PDF

. 2013. “Analyzing Graphs with Node Differential Privacy.” In Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography, Pp. 457–476. Berlin, Heidelberg: Springer-Verlag. Publisher's Version PDF

. 2013. “Answering n

. 2013. “_{{2+o(1)}}counting queries with differential privacy is hard.” In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Pp. 361-370. Palo Alto, California, USA: ACM. DOIAbstract PDFCharacterizing the Sample Complexity of Private Learners.” In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, Pp. 97–110. New York, NY, USA: ACM. Publisher's Version PDF

. 2013. “Characterizing the sample complexity of private learners.” In Proceedings of the 4th conference on Innovations in Theoretical Computer Science, Pp. 97-110. Berkeley, California, USA: ACM. DOIAbstract PDF

. 2013. “Differential privacy for the analyst via private equilibrium computation.” In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Pp. 341-350. Palo Alto, California, USA: ACM. DOIAbstract PDF

. 2013. “ . 2013. “Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities.” . Automata, Languages, and Programming, 7965, Pp. 303-314. DOIAbstract PDF

. 2013. “Estimation of exchangeable graph models by stochastic blockmodel approximation.” In Global Conference on Signal and Information Processing (GlobalSIP), 2013 IEEE, Pp. 293-296. PDF

. 2013. “ . 2013. “Identifying Participants in the Personal Genome Project by Name.” Data Privacy Lab, IQSS, Harvard University. Project website PDF

. 2013. “Interactive proofs of proximity: delegating computation in sublinear time.” In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Pp. 793-802. Palo Alto, California, USA: ACM. DOIAbstract PDF

. 2013. “Matching Known Patients to Health Records in Washington State Data.” Data Privacy Lab, IQSS, Harvard University. Project website PDF

. 2013. “Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.” In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 8096: Pp. 363-378. Springer Berlin Heidelberg. Publisher's Version PDF

. 2013. “