Using convex relaxations for efficiently and privately releasing marginals

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2014, Pages 261-270

  Dwork, Cynthia ^a   Nikolov, Aleksandar ^b   Talwar, Kunal ^a  

^a MICROSOFT RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Convex relaxation; Differential privacy; Marginals

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; ERROR ANALYSIS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; RELAXATION PROCESSES;

AUXILIARY INFORMATION; CONVEX RELAXATION; DIFFERENTIAL PRIVACIES; FRANK-WOLFE ALGORITHMS; INFORMATION THEORETIC BOUNDS; MARGINALS; POLYNOMIAL-TIME ALGORITHMS; SUCCINCT REPRESENTATION;

QUERY PROCESSING;

EID: 84904409235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2582112.2582123     Document Type: Conference Paper

References (33)

1. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. In ACM Symposium on Theory of Computing, pages 72-80, 2004.
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 L. Libkin, editor, Proceedings of ACM PODS, pages 273-282. ACM, 2007.
3. A. Blum, K. Ligett, and A. 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. M. Bun, J. Ullman, and S. Vadhan. Fingerprinting codes and the price of approximate differential privacy. arXiv preprint arXiv:1311.3158, 2013.
5. S. R. Buss, D. Grigoriev, R. Impagliazzo, and T. Pitassi. Linear gaps between degrees for the polynomial calculus modulo distinct primes. J. Comput. Syst. Sci., 62(2):267-289, 2001.
6. K. Chandrasekaran, J. Thaler, J. Ullman, and A. Wan. Faster private release of marginals on small databases. CoRR, abs/1304.3754, 2013.
7. M. Cheraghchi, A. Klivans, P. Kothari, and H. K. Lee. Submodular functions are noise stable. In SODA, pages 1586-1592, 2012.
8. K. Clarkson. Coresets, sparse greedy approximation, and the frank-wolfe algorithm. ACM Transactions on Algorithms (TALG), 6(4):63, 2010.
9. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22:60-65, 2003.
10. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. 22nd ACM Symposium on Principles of Database Systems, pages 202-210, 2003.
11. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
12. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation, 2006.
13. C. Dwork, F. Mcsherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
14. C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results. In Proceedings of the 41st ACM Symposium on Theory of Computing, 2009.
15. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In Advances in Cryptology-CRYPTO'04, pages 528-544, 2004.
16. C. Dwork and A. Roth. The Algorithmic Foundations of Differential Privacy. 2014.
17. C. Dwork, G. N. Rothblum, and S. Vadhan. Boosting and differential privacy. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pages 51-60. IEEE, 2010.
18. M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1-2):95-110, 1956.
19. D. Grigoriev. Linear lower bound on degrees of positivstellensatz calculus proofs for the parity. Theor. Comput. Sci., 259(1-2):613-622, 2001.
20. A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. Sao Paulo, 8(1-79):88, 1953.
21. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
22. A. Gupta, M. Hardt, A. Roth, and J. Ullman. Privately releasing conjunctions and the statistical query barrier. In STOC, pages 803-812, 2011.
23. M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In NIPS, 2012. To appear.
24. M. Hardt and G. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. Proc. 51st Foundations of Computer Science (FOCS). IEEE, 2010.
25. M. Hardt, G. N. Rothblum, and R. A. Servedio. Private data release via learning thresholds. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pages 168-187. SIAM, 2012.
26. M. Hardt and K. 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.
27. S. Kasiviswanathan, M. Rudelson, A. Smith, and J. 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, pages 775-784. ACM, 2010.
28. J. Lindenstrauss and A. Pełczyński. Absolutely summing operators in fpg-spaces and their applications. Studia Mathematica, 29(3):275-326, 1968.
29. A. Nikolov, K. Talwar, and L. Zhang. The geometry of differential privacy: the sparse and approximate cases. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pages 351-360, New York, NY, USA, 2013. ACM.
30. R. O'Donnell and Y. Zhou. Approximability and proof complexity. In SODA, pages 1537-1556, 2013.
31. A. Roth and T. 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.
32. J. Thaler, J. Ullman, and S. P. Vadhan. Faster algorithms for privately releasing marginals. In ICALP (1), pages 810-821, 2012.
33. J. Ullman and S. Vadhan. Pcps and the hardness of generating private synthetic data. In Proceedings of the 8th conference on Theory of Cryptography, 2011.