Exploiting metric structure for efficient private query release

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 523-534

  Huang, Zhiyi ^a   Roth, Aaron ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; SET THEORY; TOPOLOGY;

ANSWERING QUERIES; AVERAGE DISTANCE; COMPUTATIONALLY EFFICIENT; DATABASE SIZE; HARDNESS RESULT; METRIC SPACES; POLYNOMIAL-TIME; RELEASE SETTING;

QUERY PROCESSING;

EID: 84902078319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.39     Document Type: Conference Paper

References (21)

1. Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim. Practical privacy: The sulq framework. In Proceedings of the 24th ACM SIGMOD-SIGACT- SIGART Symposium on Principles of Database Systems, pages 128-138. ACM, 2005.
2. Avrim Blum, Katrina Ligett, and Aaron Roth. A learning theory approach to non-interactive database privacy. In Proceedings of the 40th annual ACM Symposium on Theory of Computing, pages 609-618. ACM, 2008.
3. Avrim Blum and Aaron Roth. Fast private data release algorithms for sparse queries. arXiv preprint arXiv:1111.6842, 2011.
4. Jean Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1):46-52, 1985.
5. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 202-210. ACM, 2003.
6. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Proceedings of the 3rd Conference on Theory of Cryptography, pages 265-284. Springer, 2006.
7. 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, pages 381- 390. ACM, 2009.
8. Cynthia Dwork, Guy N. Rothblum, and Salil Vadhan. Boosting and differential privacy. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pages 51-60. IEEE, 2010.
9. Dan Feldman, Amos Fiat, Haim Kaplan, and Kobbi Nissim. Private coresets. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pages 361-370. ACM, 2009.
10. Tadeusz Figiel, Joram Lindenstrauss, and Vitali D. Milman. The dimension of almost spherical sections of convex bodies. Acta Mathematica, 139(1):53-94, 1977.
11. Anupam Gupta, Moritz Hardt, Aaron Roth, and Jonathan Ullman. Privately releasing conjunctions and the statistical query barrier. In Proceedings of the 43rd annual ACM Symposium on Theory of Computing, pages 803-812. ACM, 2011.
12. Anupam Gupta, Aaron Roth, and Jonathan Ullman. Iterative constructions and private data release. In Proceedings of the 9th Conference on Theory of Cryptography, pages 339-356. Springer, 2012.
13. Moritz Hardt and Guy N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proceedings of the 51st IEEE Annual Symposium on Foundations of Computer Science, pages 61- 70. IEEE, 2010.
14. Moritz Hardt, Guy N. Rothblum, and Rocco A. Servedio. Private data release via learning thresholds. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 168-187. SIAM, 2012.
15. Piotr Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 10-33. IEEE, 2001.
16. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of the ACM, 53(3):307-323, 2006.
17. Prateek Jain and Abhradeep Thakurta. Mirror descent based database privacy. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, pages 579-590, 2012.
18. Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
19. Aaron Roth and Tim Roughgarden. Interactive privacy via the median mechanism. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pages 765-774. ACM, 2010.
20. Justin Thaler, Jonathan Ullman, and Salil Vadhan. Faster algorithms for privately releasing marginals. Automata, Languages, and Programming, pages 810- 821, 2012.
21. 2+o(1) counting queries with differential privacy is hard. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, pages 361-370. ACM, 2013.