Differential privacy for the analyst via private equilibrium computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 341-350

  Hsu, Justin ^a   Roth, Aaron ^a   Ullman, Jonathan ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Analyst privacy; Bregman projection; Differential privacy; No regret learning; Zero sum game

Indexed keywords

BREGMAN PROJECTION; DIFFERENTIAL PRIVACIES; JOINT DISTRIBUTIONS; NEW MECHANISMS; NO-REGRET LEARNING; OPTIMAL ERROR; PRIVATE DATABASE; ZERO-SUM GAME;

COMPUTATION THEORY; GAME THEORY; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 84879816558     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488651     Document Type: Conference Paper

References (22)

1. BARAK, B., HARDT, M., AND KALE, S. The Uniform Hardcore Lemma via Approximate Bregman Projections. In SODA (2009), pp. 1193-1200.
2. BLUM, A., DWORK, C., MCSHERRY, F., AND NISSIM, K. Practical privacy: the sulq framework. In PODS (2005).
3. BLUM, A., LIGETT, K., AND ROTH, A. A learning theory approach to non-interactive database privacy. In STOC (2008).
4. DINUR, I., AND NISSIM, K. Revealing information while preserving privacy. In PODS (2003).
5. DWORK, C., MCSHERRY, F., NISSIM, K., AND SMITH, A. Calibrating noise to sensitivity in private data analysis. In TCC (2006).
6. DWORK, C., NAOR, M., REINGOLD, O., ROTHBLUM, G., AND VADHAN, S. On the complexity of differentially private data release: efficient algorithms and hardness results. In STOC (2009).
7. DWORK, C., NAOR, M., AND VADHAN, S. P. The Privacy of the Analyst and The Power of the State. In FOCS (2012).
8. DWORK, C., ROTHBLUM, G. N., AND VADHAN, S. P. Boosting and Differential Privacy. In FOCS (2010), pp. 51-60.
9. FREUND, Y., AND SCHAPIRE, R. Game theory, on-line prediction and boosting. In Proceedings of the ninth annual conference on Computational learning theory (1996), ACM, pp. 325-332.
10. GUPTA, A., HARDT, M., ROTH, A., AND ULLMAN, J. Privately releasing conjunctions and the statistical query barrier. In STOC (2011).
11. GUPTA, A., ROTH, A., AND ULLMAN, J. Iterative constructions and private data release. In TCC (2012).
12. HARDT, M., LIGETT, K., AND MCSHERRY, F. A simple and practical algorithm for differentially private data release. BIPS (2012).
13. HARDT, M., AND ROTHBLUM, G. N. A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. In FOCS (2010), pp. 61-70.
14. HSU, J., ROTH, A., AND ULLMAN, J. Differential privacy for the analyst via private equilibrium computation. CoRR abs/1211.0877 (2012).
15. KASIVISWANATHAN, S., LEE, H., NISSIM, K., RASKHODNIKOVA, S., AND SMITH, A. What can we learn privately? SIAM Journal on Computing 40, 3 (2011), 793-826.
16. KEARNS, M., PAI, M., ROTH, A., AND ULLMAN, J. Mechanism design in large games: Incentives and privacy. arXiv preprint arXiv:1207.4084 (2012).
17. MCGREGOR, A., MIRONOV, I., PITASSI, T., REINGOLD, O., TALWAR, K., AND VADHAN, S. The limits of two-party differential privacy. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on (2010), IEEE, pp. 81-90.
18. MCSHERRY, F., AND TALWAR, K. Mechanism design via differential privacy. In FOCS (2007).
19. RAKHLIN, A., AND SRIDHARAN, K. Statistical Learning Theory and Sequential Prediction. http://www-stat.wharton.upenn.edu/~rakhlin/courses/stat928/stat928- notes.pdf, 2012.
20. ROTH, A. The algorithmic foundations of data privacy, course notes. http://www.cis.upenn.edu/~aaroth/courses/privacyF11.html, 2011.
21. ROTH, A., AND ROUGHGARDEN, T. Interactive privacy via the median mechanism. In STOC (2010).
22. ULLMAN, J. Answering n2+o(1) counting queries with differential privacy is hard. CoRR abs/1207.6945 (2012).