Unconditional differentially private mechanisms for linear queries

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 1269-1283

  Bhaskara, Aditya ^a   Dadush, Daniel ^b   Krishnaswamy, Ravishankar ^c   Talwar, Kunal ^d  

^a PRINCETON UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

differential privacy; slicing conjecture

Indexed keywords

APPROXIMATION RATIOS; CONVEX BODY; CONVEX GEOMETRY; DIFFERENTIAL PRIVACIES; GEOMETRIC PROPERTIES; LOWER BOUNDS; ORTHOGONAL SUBSPACES; SLICING CONJECTURE;

COMPUTATION THEORY; GEOMETRY;

QUERY LANGUAGES;

EID: 84862590720     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214089     Document Type: Conference Paper

References (34)

1. Keith M. Ball. Logarithmically concave functions and sections of convex sets in Rn. Studia Mathematica, 1988:69-84.
2. Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, and Kunal Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In Proc. 26th PODS, pages 273-282. ACM, 2007.
3. Avrim Blum, Katrina Ligett, and Aaron Roth. A learning theory approach to non-interactive database privacy. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 609-618, New York, NY, USA, 2008. ACM.
4. Hai Brenner and Kobbi Nissim. Impossibility of differentially private universally optimal mechanisms. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 71-80, Washington, DC, USA, 2010. IEEE Computer Society.
5. Anindya De. Lower bounds in differential privacy. CoRR, abs/1107.2183, 2011.
6. Martin E. Dyer, Alan M. Frieze, and Ravi Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991.
7. Alexander Dinghas. Über eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternikschem Typus. Math. Z., 68:111-125, 1957.
8. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Proc. 3rd TCC, pages 265-284. Springer, 2006.
9. Cynthia Dwork, Frank McSherry, and Kunal Talwar. The price of privacy and the limits of LP decoding. In Proc. 39th STOC, pages 85-94. ACM, 2007.
10. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In Proc. 22nd PODS, pages 202-210. ACM, 2003.
11. Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil 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, pages 381-390, New York, NY, USA, 2009. ACM.
12. Daniel Dadush, Chris Peikert, and Santosh Vempala. Enumerative algorithms for the shortest and closest lattice vector problems in any norm via m-ellipsoid coverings. CoRR, abs/1011.5666, 2010.
13. Cynthia Dwork, Guy N. Rothblum, and Salil Vadhan. Boosting and differential privacy. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 51-60, Washington, DC, USA, 2010. IEEE Computer Society.
14. Cynthia Dwork and Sergey Yekhanin. New efficient attacks on statistical disclosure control mechanisms. In Proc. 28th CRYPTO, pages 469-480. Springer, 2008.
15. Apostolos Giannopoulos. Notes on isotropic convex bodies., 2003.
16. Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan. Universally utility-maximizing privacy mechanisms. In STOC, pages 351-360, 2009.
17. Mangesh Gupte and Mukund Sundararajan. Universally optimal privacy mechanisms for minimax agents. In Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '10, pages 135-146, New York, NY, USA, 2010. ACM.
18. Moritz Hardt and Guy N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 61-70, Washington, DC, USA, 2010. IEEE Computer Society.
19. Moritz Hardt and Kunal Talwar. On the geometry of differential privacy. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 705-714, New York, NY, USA, 2010. ACM.
20. B. Klartag. An isomorphic version of the slicing problem. Journal of Functional Analysis, 218(2):372 - 394, 2005.
21. B. Klartag. On convex perturbations with a bounded isotropic constant. Geometric And Functional Analysis, 16:1274-1290, 2006. 10.1007/s00039-006-0588- 1.
22. Bo'az Klartag and Vitali Milman. Geometry of log-concave functions and measures. Geom. Dedicata, 170:169-182, 2005.
23. Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith, and Jonathan Ullman. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 775-784, New York, NY, USA, 2010. ACM.
24. Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, and Andrew McGregor. Optimizing linear counting queries under differential privacy. In Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '10, pages 123-134, New York, NY, USA, 2010. ACM.
25. László Lovász and Miklós Simonovits. Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms, 4(4):359-412, 1993.
26. László Lovász and Santosh Vempala. Simulated annealing in convex bodies and an*(4) volume algorithm. J. Comput. Syst. Sci., 72(2):392-417, 2006.
27. Frank McSherry and Ilya Mironov. Differentially private recommender systems: building privacy into the net. In Proc. 15th KDD, pages 627-636. ACM, 2009.
28. V. Milman and A. Pajor. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space. Geometric Aspects of Functional Analysis, 1376:64-104, 1989.
29. V.D. Milman and A. Pajor. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space. Geometric Aspects of Functional Analysis, 1376:64-104, 1989.
30. Frank McSherry and Kunal Talwar. Mechanism design via differential privacy. In Proc. 48th FOCS, pages 94-103. IEEE, 2007.
31. Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. Smooth sensitivity and sampling in private data analysis. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 75-84, New York, NY, USA, 2007. ACM.
32. Vibhor Rastogi, Sungho Hong, and Dan Suciu. The boundary between privacy and utility in data publishing. In Christoph Koch, Johannes Gehrke, Minos N. Garofalakis, Divesh Srivastava, Karl Aberer, Anand Deshpande, Daniela Florescu, Chee Yong Chan, Venkatesh Ganti, Carl-Christian Kanne, Wolfgang Klas, and Erich J. Neuhold, editors, VLDB, pages 531-542. ACM, 2007.
33. Aaron Roth and Tim Roughgarden. Interactive privacy via the median mechanism. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 765-774, New York, NY, USA, 2010. ACM.
34. Santosh Vempala. Geometric random walks: a survey. MSRI Volume on Combinatorial and Computational Geometry, 52:577-616, 2005.