The privacy of the analyst and the power of the state

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 400-409

  Dwork, Cynthia ^a   Naor, Moni ^b   Vadhan, Salil ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c HARVARD UNIVERSITY   (United States)

Author keywords

differential privacy; list decoding; long code

Indexed keywords

DATA ANALYSTS; DIFFERENTIAL PRIVACIES; LIST DECODING; LONG CODES; NON-TRIVIAL; PRIVACY MECHANISMS; PRIVATE DATA ANALYSIS;

COMPUTER SCIENCE; QUERY PROCESSING;

DATA PRIVACY;

EID: 84871959002     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.87     Document Type: Conference Paper

References (25)

1. C. Dwork, "Differential privacy," in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP)(2), 2006, pp. 1-12.
2. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proceedings of the 3rd Theory of Cryptography Conference, 2006, pp. 265-284.
3. C. Dwork, "A firm foundation for private data analysis," Communications of the ACM, vol. 54, 2011.
4. "American library association, "other policies and guidelines"," http://www.ala.org/Template.cfm?Section= otherpolicies&Template=/ContentManagement/ContentDisplay.cfm&ContentID= 13084, [Online; Accessed April 04, 2012].
5. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, "Private information retrieval," JACM, 1998, preliminary version in FOCS, 1995.
6. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. N. Wright, "Secure multiparty computation of approximations," in ICALP, ser. Lecture Notes in Computer Science, F. Orejas, P. G. Spirakis, and J. van Leeuwen, Eds., vol. 2076. Springer, 2001, pp. 927-938.
7. M. Naor and V. Teague, "Anti-presistence: history independent data structures," in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. New York: ACM, 2001, pp. 492-501. [Online]. Available: http://dx.doi.org/10.1145/380752. 380844
8. I. Dinur and K. Nissim, "Revealing information while preserving privacy," in Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003, pp. 202-210.
9. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, "Our data, ourselves: privacy via distributed noise generation," in Advances in Cryptology: Proceedings of EUROCRYPT, 2006, pp. 486-503.
10. A. Beimel, K. Nissim, and E. Omri, "Distributed private data analysis: Simultaneously solving how and what," in CRYPTO, ser. Lecture Notes in Computer Science, D. Wagner, Ed., vol. 5157. Springer, 2008, pp. 451-468.
11. A. Blum, K. Ligett, and A. Roth, "A learning theory approach to non-interactive database privacy," in Proceedings of the 40th ACM SIGACT Symposium on Theory of Computing, 2008.
12. 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 STOC, 2009, pp. 381-390.
13. A. Roth and T. Roughgarden, "The median mechanism: Interactive and efficient privacy with multiple queries," in Proc. of STOC, pp. 765-774.
14. C. Dwork, G. N. Rothblum, and S. P. Vadhan, "Boosting and Differential Privacy," in Proc. FOCS, 2010, pp. 51-60.
15. M. Hardt and G. N. Rothblum, "A multiplicative weights mechanism for interactive privacy-preserving data analysis," Proc. FOCS, 2010.
16. A. Gupta, M. Hardt, A. Roth, and J. Ullman, "Privately releasing conjunctions and the statistical query barrier," in STOC, 2011, pp. 803-812.
17. M. Hardt, K. Ligett, and F. McSherry, "A simple and practical algorithm for differentially private data release," 2010, coRR abs/1012.4763.
18. M. Bellare, O. Goldreich, and M. Sudan, "Free bits, PCPs, and nonapproximability-towards tight results," SIAM Journal on Computing, vol. 27, no. 3, pp. 804-915, 1998. [Online]. Available: http://dx.doi.org/10.1137/ S0097539796302531
19. C. Dwork, M. Naor, T. Pitassi, G. N. Rothblum, and S. Yekhanin, "Pan-private streaming algorithms," in In Proceedings of ICS, 2010.
20. C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, "Differential privacy under continual observation," in STOC, 2010, pp. 715-724.
21. 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, 2011.
22. J. Ullman, "Answering n∧{2+o(1)} Counting Queries with Differential Privacy is Hard," ArXiv e-prints, Jul. 2012.
23. O. Goldreich and L. A. Levin, "A hard-core predicate for all one-way functions," in STOC, 1989, pp. 25-32.
24. A. Gupta, A. Roth, and J. Ullman, "Iterative constructions and private data release," in Proceedings of the 9th IACR Theory of Cryptography Conference (TCC '12), ser. Lecture Notes on Computer Science. Springer-Verlag, 2012, full version posted as CoRR abs/1107.3731.
25. C. Dwork and A. Roth, "The algorithmic foundations of differential privacy," 2012, monograph in preparation.