The limits of two-party differential privacy

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

Volumn , Issue , 2010, Pages 81-90

  McGregor, Andrew ^a   Mironov, Ilya ^b   Pitassi, Toniann ^c   Reingold, Omer ^b   Talwar, Kunal ^b   Vadhan, Salil ^d  

^a University of Massachusetts Amherst   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HAMMING DISTANCE;

CLIENT SERVER; DIFFERENTIAL PRIVACIES; LOWER BOUNDS; NATURAL FUNCTIONS; PRIVATE DATA ANALYSIS; PRIVATE PROTOCOLS; SHARP CONTRAST;

DATA PRIVACY;

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

References (30)

1. M. O. Rabin, "How to exchange secretes with oblivious transfer," Aiken Computation Lab, Harvard University, Technical Report TR-81, May 1981.
2. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts." Communications of the ACM, vol. 28, no. 6, pp. 637-647, 1985.
3. E. Kushilevitz and R. Ostrovsky, "Replication is NOT needed: SINGLE database, computationally-private information retrieval," in Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997). IEEE Computer Society, 1997, pp. 364-373.
4. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982). IEEE, 1982, pp. 160-164.
5. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, ser. Lecture Notes in Computer Science, S. Halevi and T. Rabin, Eds., vol. 3876. Springer, 2006, pp. 265-284.
6. C. Dwork, "Differential privacy," in Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part II, ser. Lecture Notes in Computer Science, M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, Eds., vol. 4052. Springer, 2006, pp. 1-12.
7. A. Ghosh, T. Roughgarden, and M. Sundararajan, "Universally utility-maximizing privacy mechanisms," in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, M. Mitzenmacher, Ed. ACM, 2009, pp. 351-360.
8. C. Dwork and K. Nissim, "Privacy-preserving datamining on vertically partitioned databases," in Advances in Cryptology - CRYPTO 2004, ser. Lecture Notes in Computer Science, M. K. Franklin, Ed., vol. 3152. Springer, 2004, pp. 528-544.
9. A. Beimel, K. Nissim, and E. Omri, "Distributed private data analysis: Simultaneously solving how and what," in Advances in Cryptology - CRYPTO 2008, ser. Lecture Notes in Computer Science, D. Wagner, Ed., vol. 5157. Springer, 2008, pp. 451-468.
10. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, "Our data, ourselves: privacy via distributed noise generation," in Advances in Cryptology - EUROCRYPT 2006, ser. Lecture Notes in Computer Science, vol. 4004. Springer, 2006, pp. 486-503.
11. I. Mironov, O. Pandey, O. Reingold, and S. P. Vadhan, "Computational differential privacy," in CRYPTO, ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Springer, 2009, pp. 126-142.
12. U. V. Vazirani, "Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources," Combinatorica, vol. 7, no. 4, pp. 375-392, 1987. [Online]. Available: http://dx.doi.org/10.1007/BF02579325
13. S. L. Warner, "Randomized response: A survey technique for eliminating evasive answer bias," Journal of the American Statistical Association, vol. 60, no. 309, pp. 63-69, Mar. 1965.
14. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, "An information statistics approach to data stream and communication complexity," in 43rd Symposium on Foundations of Computer Science, FOCS 2002. IEEE Computer Society, 2002, pp. 209-218.
15. R. Jain and H. Klauck, "The partition bound for classical communication complexity and query complexity," in Annual IEEE Conference on Computational Complexity, 2010.
16. B. Barak, M. Braverman, X. Chen, and A. Rao, "How to compress interactive communication," in Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, L. J. Schulman, Ed. ACM, 2010, pp. 67-76.
17. A. Chakrabarti and O. Regev, "Tight lower bound for the Gap Hamming problem," 2010, unpublished manuscript.
18. U. Manber, "Finding similar files in a large file system," in USENIX Winter, 1994, pp. 1-10.
19. T. Holenstein, "Parallel repetition: Simplification and the no-signaling case," Theory of Computing, vol. 5, no. 1, pp. 141-172, 2009. [Online]. Available: http://www.theoryofcomputing.org/articles/v005a008
20. J. Feigenbaum, A. D. Jaggard, and M. Schapira, "Approximate privacy: foundations and quantification (extended abstract)," in ACM Conference on Electronic Commerce, 2010, pp. 167-178.
21. B. Chor and E. Kushilevitz, "A zero-one law for boolean privacy," SIAM J. Discrete Math., vol. 4, no. 1, pp. 36-47, 1991.
22. E. Kushilevitz, "Privacy and communication complexity," SIAM J. Discrete Math., vol. 5, no. 2, pp. 273-284, 1992.
23. A. C.-C. Yao, "Some complexity questions related to distributive computing (preliminary report)," in STOC '79: Proceedings of the eleventh annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1979, pp. 209-213.
24. M. Sántha and U. V. Vazirani, "Generating quasirandom sequences from semirandom sources," Journal of Computer and System Sciences, vol. 33, no. 1, pp. 75-87, 1986. [Online]. Available: http://dx.doi.org/10.1016/0022-0000(86)90044-9
25. O. Reingold, S. Vadhan, and A. Wigderson, "A note on extracting randomness from Santha-Vazirani sources," 2004, unpublished manuscript.
26. Y. Dodis and R. Oliveira, "On extracting private randomness over a public channel," in RANDOM-APPROX, ser. Lecture Notes in Computer Science, S. Arora, K. Jansen, J. D. P. Rolim, and A. Sahai, Eds., vol. 2764. Springer, 2003, pp. 252-263.
27. D. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, 2009.
28. A. Chakrabarti, Y. Shi, A. Wirth, and A. C. Yao, "Informational complexity and the direct sum problem for simultaneous message complexity," in Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 270-278.
29. F. McSherry and K. Talwar, "Mechanism design via differential privacy," in 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007). IEEE Computer Society, 2007, pp. 94-103.
30. C. Dwork, M. Naor, T. Pitassi, G. Rothblum, and S. Yekhanin, "Panprivate streaming algorithms," in Proceedings of the First Symposium on Innovations in Computer Science (ICS 2010). Tsinghua University Press, Beijing, 2010.