Faster private release of marginals on small databases

ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2014, Pages 387-401

  Chandrasekaran, Karthekeyan ^a   Thaler, Justin ^a   Ullman, Jonathan ^a   Wan, Andrew ^b  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; POLYNOMIALS; QUERY LANGUAGES;

APPROXIMATE POLYNOMIALS; DIFFERENTIAL PRIVACIES; LOW HAMMING WEIGHTS; MARGINALS; NON-TRIVIAL; ON-LINE ALGORITHMS; PRIVATE DATA ANALYSIS; UPPER AND LOWER BOUNDS;

QUERY PROCESSING;

EID: 84893223230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2554797.2554833     Document Type: Conference Paper

References (37)

1. 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 PODS, pages 273-282, 2007.
2. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS, pages 128-138, 2005.
3. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC, pages 609-618, 2008.
4. 0 Functions, and Spectral Norms. SIAM J. Comput., 21(1): 33-42, 1992.
5. M. Bun and J. Thaler. Dual lower bounds for approximate degree and markov-bernstein inequalities. In Proceedings of 40th International Colloquium on Automata, Languages, and Programming, pages 303-314, 2013.
6. M. Bun, J. Ullman, and S. P. Vadhan. Fingerprinting codes and the price of approximate differential privacy. CoRR, abs/1311.3158, 2013.
7. M. Cheraghchi, A. Klivans, P. Kothari, and H. K. Lee. Submodular functions are noise stable. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1586-1592, 2012.
8. A. De. Lower bounds in differential privacy. In TCC, pages 321-338, 2012.
9. I. Dinur and K. Nissim. Revealing information while preserving privacy. In PODS, pages 202-210, 2003.
10. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC'06, pages 265-284, 2006.
11. C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. P. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results. In STOC'09, pages 381-390, 2009.
12. C. Dwork, A. Nikolov, and K. Talwar. Efficient algorithms for privately releasing marginals via convex relaxations. CoRR, abs/1308.1385, 2013.
13. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, pages 528-544, 2004.
14. C. Dwork, G. N. Rothblum, and S. P. Vadhan. Boosting and differential privacy. In FOCS, pages 51-60, 2010.
15. V. Feldman and P. Kothari. Learning coverage functions. Manuscript, 2013.
16. A. Gupta, M. Hardt, A. Roth, and J. Ullman. Privately releasing conjunctions and the statistical query barrier. In STOC'11, pages 803-812, 2011.
17. A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. In TCC, pages 339-356, 2012.
18. M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. NIPS'12, 2012.
19. M. Hardt and G. N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS, pages 61-70, 2010.
20. M. Hardt, G. N. Rothblum, and R. A. Servedio. Private data release via learning thresholds. In SODA, pages 168-187, 2012.
21. P. Jain and A. Thakurta. Mirror descent based database privacy. In APPROX-RANDOM, pages 579-590, 2012.
22. S. P. 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 STOC, pages 775-784, 2010.
23. H. Klauck. On arthur merlin games in communication complexity. In Proceedings of the 26th Annual Conference on Computational Complexity (CCC), CCC, pages 189-199, 2011.
24. A. R. Klivans and R. A. Servedio. Toward attribute efficient learning of decision lists and parities. In J. Shawe-Taylor and Y. Singer, editors, COLT, Volume 3120 of Lecture Notes in Computer Science, pages 224-238. Springer, 2004.
25. P. M. Long and R. A. Servedio. Low-weight halfspaces for sparse boolean vectors. In ITCS, pages 21-36, 2013.
26. A. Nikolov, K. Talwar, and L. Zhang. The geometry of differential privacy: the sparse and approximate cases. In STOC, pages 351-360, 2013.
27. R. Paturi. On the degree of polynomials that approximate symmetric boolean functions. In Proceedings of the twenty-fourth annual ACM Symposium on Theory of Computing, pages 468-474, 1992.
28. A. Roth and T. Roughgarden. Interactive privacy via the median mechanism. In STOC'10, pages 765-774, 2010.
29. R. Servedio, L.-Y. Tan, and J. Thaler. Attribute-efficient learning and weight-degree tradeoffs for polynomial threshold functions. In 25th Annual Conference on Computational Learning Theory (COLT), JMLR Workshop and Conference Proceeding, Volume 23, pages 14.1-14.19, 2012.
30. A. A. Sherstov. The intersection of two halfspaces has high threshold degree. In Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS'09, pages 343-362, 2009.
31. A. A. Sherstov. The pattern matrix method. SIAM Journal on Computing, 40(6): 1969-2000, 2011.
32. A. A. Sherstov. The multiparty communication complexity of set disjointness. In STOC, pages 525-548, 2012.
33. A. A. Sherstov. Strong direct product theorems for quantum communication and query complexity. SIAM J. Comput., 41(5): 1122-1165, 2012.
34. J. Thaler, J. Ullman, and S. P. Vadhan. Faster algorithms for privately releasing marginals. In ICALP, pages 810-821, 2012. 2+o(1)
35. J. Ullman. Answering n counting queries with differential privacy is hard. In STOC, pages 361-370, 2013.
36. J. Ullman and S. P. Vadhan. PCPs and the hardness of generating private synthetic data. In TCC'11, pages 400-416, 2011.
37. R. Špalek. A dual polynomial for OR. CoRR, abs/0803.4516, 2008.