Optimal private halfspace counting via discrepancy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 1285-1292

  Muthukrishnan, S ^a   Nikolov, Aleksandar ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

combinatorial discrepancy; differential privacy; range counting

Indexed keywords

ARBITRARY SUBSETS; AVERAGE SQUARED ERRORS; CENTRAL PROBLEMS; COMBINATORIAL DISCREPANCY; COUNTING PROBLEMS; D DIMENSIONS; DIFFERENTIAL PRIVACIES; DISCREPANCY THEORY; HALF-SPACE; INTEGER WEIGHTS; LOWER BOUNDS; PARTIAL COLORING; RANGE COUNTING; RANGE SPACES; UPPER BOUND;

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY;

APPROXIMATION ALGORITHMS;

EID: 84862589671     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214090     Document Type: Conference Paper

References (33)

1. P.K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Advances in discrete and computational geometry: proceedings of the 1996 AMS-IMS-SIAM joint summer research conference, Discrete and Computational Geometry-Ten Years Later, July 14-18, 1996, Mount Holyoke College, volume 223, page 1. Amer Mathematical Society, 1999.
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 Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '07, pages 273-282, New York, NY, USA, 2007. ACM.
3. Jozsef Beck. Balanced two-colorings of finite sets in the square. Combinatorica, 1(4):327-335, 1981.
4. 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, STOC '08, pages 609-618, New York, NY, USA, 2008. ACM.
5. T.H.H. Chan, E. Shi, and D. Song. Private and continual release of statistics. In ICALP, 2010.
6. T.M. Chan. Optimal partition trees. In Proceedings of the 2010 annual symposium on Computational geometry, pages 1-10. ACM, 2010.
7. B. Chazelle. The discrepancy method. Cambridge Univ. Press, 2000.
8. B. Chazelle and A. Lvov. A trace bound for the hereditary discrepancy. Discrete & Computational Geometry, 26(2):221-231, 2001. (Pubitemid 33587310)
9. B. Chazelle, J. Matoušek, and M. Sharir. An elementary approach to lower bounds in geometric discrepancy. Discrete & Computational Geometry, 13(1):363-381, 1995.
10. B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite vc-dimension. Discrete Comput. Geom., 4:467-489, September 1989.
11. Anindya De. Lower bounds in differential privacy. CoRR, abs/1107.2183, 2011.
12. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '03, pages 202-210, New York, NY, USA, 2003. ACM.
13. C. Dwork, F. Mcsherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
14. C. Dwork, G. N. Rothblum, and S. Vadhan. Boosting and differential privacy. In Proc. 51st Annual IEEE Symp. Foundations of Computer Science (FOCS), pages 51-60, 2010.
15. Cynthia Dwork, Frank McSherry, and Kunal Talwar. The price of privacy and the limits of lp decoding. In STOC, pages 85-94, 2007.
16. 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.
17. Cynthia Dwork and Sergey Yekhanin. New efficient attacks on statistical disclosure control mechanisms. In CRYPTO, pages 469-480, 2008.
18. 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, STOC '11, pages 803-812, New York, NY, USA, 2011. ACM.
19. Anupam Gupta, Aaron Roth, and Jonathan Ullman. Iterative constructions and private data release. CoRR, abs/1107.3731, 2011.
20. M. Hardt and G. N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proc. 51st Annual IEEE Symp. Foundations of Computer Science (FOCS), pages 61-70, 2010.
21. Moritz Hardt, Katrina Ligett, and Frank McSherry. A simple and practical algorithm for differentially private data release. CoRR, abs/1012.4763, 2010.
22. 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.
23. D. Haussler. Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69(2):217-232, 1995.
24. 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.
25. J. Matousek. Tight upper bounds for the discrepancy of half-spaces. Discrete and Computational Geometry, 13(1):593-601, 1995.
26. J. Matousek. Geometric discrepancy: An illustrated guide, volume 18. Springer Verlag, 2010.
27. Aaron Roth. Differential privacy and the fat-shattering dimension of linear queries. In Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, APPROX/RANDOM'10, pages 683-695, Berlin, Heidelberg, 2010. Springer-Verlag.
28. 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.
29. K.F. Roth. On irregularities of distribution. Mathematika, 1(02):73-79, 1954.
30. J. Spencer. Six standard deviations suffice. Trans. Amer. Math. Soc, 289, 1985.
31. Emo Welzl. On spanning trees with low crossing numbers. In Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, pages 233-249, London, UK, 1992. Springer-Verlag.
32. Xiaokui Xiao, Guozhang Wang, and J. Gehrke. Differential privacy via wavelet transforms. In Proc. IEEE 26th Int Data Engineering (ICDE) Conf, pages 225-236, 2010.
33. Andrew Chi-Chih Yao and F. Frances Yao. A general approach to d-dimensional geometric queries (extended abstract). In STOC, pages 163-168, 1985.