The composition theorem for differential privacy

32nd International Conference on Machine Learning, ICML 2015

Volumn 2, Issue , 2015, Pages 1376-1385

  Kairouz, Peter ^a   Oh, Sewoong ^a   Viswanath, Pramod ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA HANDLING; PRIVATIZATION; QUERY PROCESSING;

COMPOSITION THEOREM; DIFFERENTIAL PRIVACIES; HYPOTHESIS TESTING; OPERATIONAL INTERPRETATION; PRIVACY LEVELS; STATE OF THE ART; UPPER BOUND;

LEARNING SYSTEMS;

EID: 84969812974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Blachman, N. The convolution inequality for entropy powers. Information Theory, IEEE Transactions on, 11(2): 267-271, 1965.
2. Blackwell, David. Equivalent comparisons of experiments. The Annals of Mathematical Statistics, 24(2):265-272, 1953.
3. Blocki, Jeremiah, Blum, Avrim, Datta, Anupam, and Shef-fet, Or. The johnson-lindenstrauss transform itself preserves differential privacy. In Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on, pp. 410-419. IEEE, 2012.
4. Blum, Avrim, Dwork, Cynthia, McSherry, Frank, and Nissim, Kobbi. Practical privacy: the SuLQ framework. In Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 128-138. ACM, 2005.
5. Blum, Avrim, Ligett, Katrina, and Roth, Aaron. A learning theory approach to noninteractive database privacy. Journal of the ACM (JACM), 60(2): 12, 2013.
6. Cover, Thomas M and Thomas, A. Determinant inequalities via information theory. SIAM journal on Matrix Analysis and Applications, 9(3):384-392, 1988.
7. Cover, Thomas M and Thomas, Joy A. Elements of information theory. John Wiley & Sons, 2012.
8. Dembo, Amir, Cover, Thomas M, and Thomas, Joy A. Information theoretic inequalities. Information Theory, IEEE Transactions on, 37(6): 1501-1518, 1991.
9. Dinur, Irit and Nissim, Kobbi. Revealing information while preserving privacy. In Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 202-210. ACM, 2003.
10. Dwork, Cynthia. Differential privacy. In Automata, languages and programming, pp. 1-12. Springer, 2006.
11. Dwork, Cynthia and Lei, Jing. Differential privacy and robust statistics. In Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 371-380. ACM, 2009.
12. Dwork, Cynthia and Nissim, Kobbi. Privacy-preserving datamining on vertically partitioned databases. In Advances in Cryptology-CRYPTO 2004, pp. 528-544. Springer, 2004.
13. Dwork, Cynthia, Kenthapadi, Krishnaram, McSherry, Frank, Mironov, Ilya, and Naor, Moni. Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology-EUROCRYPT 2006, pp. 486-503. Springer, 2006a.
14. Dwork, Cynthia, McSherry, Frank, Nissim, Kobbi, and Smith, Adam. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography, pp. 265-284. Springer, 2006b.
15. Dwork, Cynthia, Rothblum, Guy N, and Vadhan, Salil. Boosting and differential privacy. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pp. 51-60. IEEE, 2010.
16. Geng, Quan and Viswanath, Pramod. Optimal noise-adding mechanism in differential privacy. arXiv preprint arXiv:1212.1186, 2012.
17. Geng, Quan and Viswanath, Pramod. The optimal mechanism in (⋯, δ)-differential privacy. arXiv preprint arXiv:1305.1330, 2013.
18. Ghosh, Arpita, Roughgarden, Tim, and Sundararajan, Mukund. Universally utility-maximizing privacy mechanisms. SIAM Journal on Computing, 41(6): 1673-1693, 2012.
19. Green, Ben and Tao, Terence. The primes contain arbitrarily long arithmetic progressions. arXiv preprint math/0404188, 2004.
20. Gupta, Anupam, Roth, Aaron, and Ullman, Jonathan. Iterative constructions and private data release. In Theory of Cryptography, pp. 339-356. Springer, 2012.
21. Hardt, Moritz and Roth, Aaron. Beyond worst-case analysis in private singular vector computation. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, pp. 331-340. ACM, 2013.
22. Hardt, Moritz and Rothblum, Guy N. A multiplicative weights mechanism for privacy-preserving data analysis. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pp. 61-70. IEEE, 2010.
23. Hardt, Moritz and Talwar, Kunal. On the geometry of differential privacy. In Proceedings of the 42nd ACM symposium on Theory of computing, pp. 705-714. ACM, 2010.
24. Hardt, Moritz, Ligett, Katrina, and McSherry, Frank. A simple and practical algorithm for differentially private data release. arXiv preprint arXiv:1012.4763, 2010.
25. Liu, Tie and Viswanath, Pramod. An extremal inequality motivated by multiterminal information-theoretic problems. Information Theory, IEEE Transactions on, 53(5): 1839-1851, 2007.
26. McSherry, Frank and Talwar, Kunal. Mechanism design via differential privacy. In Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium on, pp. 94-103. IEEE, 2007.
27. Muthukrishnan, S and Nikolov, Aleksandar. Optimal private halfspace counting via discrepancy. In Proceedings of the 44th symposium on Theory of Computing, pp. 1285-1292. ACM, 2012.
28. Reingold, Omer, Trevisan, Luca, Tulsiani, Madhur, and Vadhan, Salil. Dense subsets of pseudorandom sets. In Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE Symposium on, pp. 76-85. IEEE, 2008.
29. Stam, AJ. Some inequalities satisfied by the quantities of information of fisher and shannon. Information and Control, 2(2): 101-112, 1959.
30. Tao, Terence and Ziegler, Tamar. The primes contain arbitrarily long polynomial progressions. Acta Mathematica, 201(2):213-305, 2008.
31. Verdu, Sergio and Guo, Dongning. A simple proof of the entropy-power inequality. IEEE Transactions on Information Theory, 52(5):2165-2166, 2006.
32. Wasserman, Larry and Zhou, Shuheng. A statistical framework for differential privacy. Journal of the American Statistical Association, 105(489):375-389, 2010.
33. Zamir, Ram. A proof of the fisher information inequality via a data processing argument. Information Theory, IEEE Transactions on, 44(3): 1246-1250, 1998.