Universally utility-maximizing privacy mechanisms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 351-359

  Ghosh, Arpita ^a   Roughgarden, Tim ^b   Sundararajan, Mukund ^b  

^a YAHOO RESEARCH   (United States)

^b Stanford University   (United States)

Author keywords

Differential privacy; Linear programming; Privacy; Utility

Indexed keywords

DIFFERENTIAL PRIVACY; FEASIBLE SOLUTION; LINEAR PROGRAMS; LOSS FUNCTIONS; OPTIMAL MECHANISM; OPTIMAL UTILITY; OUTPUT DISTRIBUTION; POLYTOPES; POTENTIAL USERS; PRIOR DISTRIBUTION; PRIVACY; PRIVACY CONSTRAINTS; PRIVACY MECHANISMS; QUERY RESULTS; RANDOM NOISE; RELEVANT VERTEX; SENSITIVE DATAS; SIDE INFORMATION; STATISTICAL DATABASE; UTILITY;

COMPUTATION THEORY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION;

OPTIMIZATION;

EID: 70350683770     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536464     Document Type: Conference Paper

References (19)

1. L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In Proceedings of the 16th International Conference on World Wide Web (WWW), pages 181-190, 2007.
2. B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In Proceedings of the 26th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 273-282, 2007.
3. D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997.
4. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: The SuLQ framework. In Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 128-138, 2005.
5. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pages 609-618, 2008.
6. U. S.C̃ensus Bureau. The 2008 statistical abstract. http://www.census.gov/compendia/statab/.
7. I. Dinur and Nissim K. Revealing information while preserving privacy. In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 202-210, 2003.
8. C. Dwork. Differential privacy. In Proceedings of the 33rd Annual International Colloquium on Automata, Languages, and Programming (ICALP), volume 4051 of Lecture Notes in Computer Science, pages 1-12, 2006.
9. C. Dwork. Differential privacy: A survey of results. In 5th International Conference on Theory and Applications of Models of Computation (TAMC), volume 4978 of Lecture Notes in Computer Science, pages 1-19, 2008.
10. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Third Theory of Cryptography Conference (TCC), volume 3876 of Lecture Notes in Computer Science, pages 265-284, 2006.
11. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 85-94, 2007.
12. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In 24th Annual International Cryptology Conference (CRYPTO), volume 3152 of Lecture Notes in Computer Science, pages 528-544, 2004.
13. S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What can we learn privately? In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 531-540, 2008.
14. S. P. Kasiviswanathan and A. Smith. A note on differential privacy: Defining resistance to arbitrary side information. http://arxiv.org/abs/0803. 3946v1, 2008.
15. A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, New York, 1995.
16. F. McSherry and K. Talwar. Mechanism design via differential privacy. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 94-103, 2007.
17. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In Proceedings of the 2008 IEEE Symposium on Security and Privacy (SP), pages 111-125, 2008.
18. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 75-84, 2007.
19. Wikipedia. AOL search data scandal. http://en.wikipedia.org/wiki/AOL- search-data-scandal.