Fingerprinting codes and the price of approximate differential privacy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2014, Pages 1-10

  Bun, Mark ^a   Ullman, Jonathan ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Differential privacy; Fingerprinting codes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS);

DIFFERENTIAL PRIVACIES; FINGERPRINTING CODE; LOWER BOUNDS; POLY-LOGARITHMIC FACTORS; PRIVATE DATA; SAMPLE COMPLEXITY;

QUERY PROCESSING;

EID: 84904197571     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591796.2591877     Document Type: Conference Paper

References (33)

1. Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., and Talwar, K. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In PODS (2007), pp. 273-282.
2. Beimel, A., Kasiviswanathan, S. P., and Nissim, K. Bounds on the sample complexity for private learning and private data release. In TCC (2010), pp. 437-454.
3. Beimel, A., Nissim, K., and Stemmer, U. Characterizing the sample complexity of private learners. In ITCS (2013), pp. 97-110.
4. Beimel, A., Nissim, K., and Stemmer, U. Private learning and sanitization: Pure vs. approximate differential privacy. In APPROX-RANDOM (2013), pp. 363-378.
5. Blum, A., Dwork, C., McSherry, F., and Nissim, K. Practical privacy: the SuLQ framework. In PODS (2005), pp. 128-138.
6. Blum, A., Ligett, K., and Roth, A. A learning theory approach to non-interactive database privacy. In STOC (2008), pp. 609-618.
7. Boneh, D., Kiayias, A., and Montgomery, H. W. Robust fingerprinting codes: a near optimal construction. In Digital Rights Management Workshop (2010), pp. 3-12.
8. Boneh, D., and Naor, M. Traitor tracing with constant size ciphertext. In ACM Conference on Computer and Communications Security (2008), pp. 501-510.
9. Boneh, D., and Shaw, J. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory 44, 5 (1998), 1897-1905.
10. Chandrasekaran, K., Thaler, J., Ullman, J., and Wan, A. Faster private release of marginals on small databases. ITCS 2014 (to appear) (2014).
11. De, A. Lower bounds in differential privacy. In TCC (2012), pp. 321-338.
12. Dinur, I., and Nissim, K. Revealing information while preserving privacy. In PODS (2003), pp. 202-210.
13. Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., and Naor, M. Our data, ourselves: Privacy via distributed noise generation. In EUROCRYPT (2006), pp. 486-503.
14. Dwork, C., McSherry, F., Nissim, K., and Smith, A. Calibrating noise to sensitivity in private data analysis. In TCC (2006), pp. 265-284.
15. Dwork, C., McSherry, F., and Talwar, K. The price of privacy and the limits of lp decoding. In STOC (2007), pp. 85-94.
16. Dwork, C., Naor, M., Reingold, O., Rothblum, G. N., and Vadhan, S. P. On the complexity of differentially private data release: efficient algorithms and hardness results. In STOC (2009), pp. 381-390.
17. Dwork, C., Nikolov, A., and Talwar, K. Efficient algorithms for privately releasing marginals via convex programming. Manuscript (2013).
18. Dwork, C., and Nissim, K. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO (2004), pp. 528-544.
19. Dwork, C., Rothblum, G. N., and Vadhan, S. P. Boosting and differential privacy. In FOCS (2010), pp. 51-60.
20. Dwork, C., and Yekhanin, S. New efficient attacks on statistical disclosure control mechanisms. In CRYPTO (2008), pp. 469-480.
21. Gupta, A., Hardt, M., Roth, A., and Ullman, J. Privately releasing conjunctions and the statistical query barrier. In STOC (2011), pp. 803-812.
22. Gupta, A., Roth, A., and Ullman, J. Iterative constructions and private data release. In TCC (2012), pp. 339-356.
23. Hardt, M. A Study in Privacy and Fairness in Sensitive Data Analysis. PhD thesis, Princeton University, 2011.
24. Hardt, M., Ligett, K., and McSherry, F. A simple and practical algorithm for differentially private data release. In NIPS (2012), pp. 2348-2356.
25. Hardt, M., and Rothblum, G. N. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS (2010), pp. 61-70.
26. Hardt, M., and Talwar, K. On the geometry of differential privacy. In STOC (2010), pp. 705-714.
27. Kasiviswanathan, S. P., Rudelson, M., Smith, A., and Ullman, J. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In STOC (2010), pp. 775-784.
28. Nikolov, A., Talwar, K., and Zhang, L. The geometry of differential privacy: the sparse and approximate cases. In STOC (2013), pp. 351-360.
29. Roth, A. Differential privacy and the fat-shattering dimension of linear queries. In APPROX-RANDOM (2010), pp. 683-695.
30. Roth, A., and Roughgarden, T. Interactive privacy via the median mechanism. In STOC (2010), pp. 765-774.
31. Tardos, G. Optimal probabilistic fingerprint codes. J. ACM 55, 2 (2008).
32. Thaler, J., Ullman, J., and Vadhan, S. P. Faster algorithms for privately releasing marginals. In ICALP (1) (2012), pp. 810-821.
33. Ullman, J. Answering n2+o(1) counting queries with differential privacy is hard. In STOC (2013), pp. 361-370.