Interactive privacy via the median mechanism

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 765-774

  Roth, Aaron ^a   Roughgarden, Tim ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

differential privacy; online algorithm

Indexed keywords

DATABASE SIZE; DOMAIN SIZE; EFFICIENT IMPLEMENTATION; NON-INTERACTIVE; ON-LINE ALGORITHMS; POLYNOMIAL FACTOR; PREDICATE QUERY; PRIVACY CONSTRAINTS; PRIVACY MECHANISMS; QUERY RESULTS; RUNNING TIME;

SECURITY OF DATA;

COMPUTATION THEORY;

EID: 77954745685     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806794     Document Type: Conference Paper

References (13)

1. A. Blum, K. Ligett, and A. 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 New York, NY, USA, 2008.
2. L. Devroye. Non-uniform random variate generation. 1986.
3. M. Dyer, A. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM (JACM), 38(1):1-17, 1991.
4. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Proceedings of the Third Theory of Cryptography Conference TCC, volume 3876 of Lecture Notes in Computer Science, page 265. Springer, 2006.
5. I. Dinur and K. Nissim. Revealing information while preserving privacy. In 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 202-210, 2003.
6. 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 annual ACM symposium on Symposium on theory of computing, pages 381-390. ACM New York, NY, USA, 2009.
7. C. Dwork. Differential privacy: A survey of results. In Proceedings of Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, volume 4978 of Lecture Notes in Computer Science, page 1. Springer, 2008.
8. A. Ghosh, T. Roughgarden, and M. Sundararajan. Universally utility-maximizing privacy mechanisms. In Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, pages 351-360. ACM New York, NY, USA, 2009.
9. M. Hardt and K. Talwar. On the Geometry of Differential Privacy. In The 42nd ACM Symposium on the Theory of Computing, 2010. STOC'10, 2010.
10. S.P. Kasiviswanathan, H.K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What Can We Learn Privately? In IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, 2008. FOCS'08, pages 531-540, 2008.
11. F. McSherry and K. Talwar. Mechanism design via differential privacy. In Proceedings of the 48th Annual Symposium on Foundations of Computer Science, 2007.
12. J. Ullman and S. Vadhan. PCPs and the Hardness of Generating Synthetic Data . Manuscript, 2010.
13. V. Vapnik. Structure of statistical learning theory. Computational Learning and Probabilistic Reasoning, page 3, 1996.