Answering n^{2+o(1)} counting queries with differential privacy is hard

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 361-370

  Ullman, Jonathan ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Differential privacy; Traitor tracing

Indexed keywords

CENTRAL PROBLEMS; DIFFERENTIAL PRIVACIES; EXPONENTIAL TIME; ONE-WAY FUNCTIONS; PRIVATE DATA ANALYSIS; TRAITOR-TRACING;

ALGORITHMS; COMPUTATION THEORY; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 84879825242     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488653     Document Type: Conference Paper

References (21)

1. Applebaum, B. Pseudorandom generators with long stretch and low locality from random local one-way functions. In STOC (2012), pp. 805-816.
2. Blum, A., Ligett, K., and Roth, A. A learning theory approach to non-interactive database privacy. In STOC (2008), pp. 609-618.
3. Boneh, D., Sahai, A., and Waters, B. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In EUROCRYPT (2006), pp. 573-592.
4. Boneh, D., and Shaw, J. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory 44, 5 (1998), 1897-1905.
5. Chor, B., Fiat, A., and Naor, M. Tracing traitors. In CRYPTO (1994), pp. 257-270.
6. Dinur, I., and Nissim, K. Revealing information while preserving privacy. In PODS (2003).
7. Dwork, C., McSherry, F., Nissim, K., and Smith, A. Calibrating noise to sensitivity in private data analysis. In TCC '06 (2006), pp. 265-284.
8. 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 '09 (2009).
9. Dwork, C., Naor, M., and Vadhan, S. The privacy of the analyst and the power of the state. Manuscript (2012).
10. Dwork, C., Rothblum, G. N., and Vadhan, S. P. Boosting and differential privacy. In FOCS (2010), IEEE Computer Society, pp. 51-60.
11. Gupta, A., Hardt, M., Roth, A., and Ullman, J. Privately releasing conjunctions and the statistical query barrier. In STOC '11 (2011), pp. 803-812.
12. Gupta, A., Roth, A., and Ullman, J. Iterative constructions and private data release. In TCC (2012), pp. 339-356.
13. Hardt, M., Ligett, K., and McSherry, F. A simple and practical algorithm for differentially private data release. NIPS '12 (2012).
14. Hardt, M., and Rothblum, G. N. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS (2010).
15. Hardt, M., Rothblum, G. N., and Servedio, R. A. Private data release via learning thresholds. In SODA (2012), pp. 168-187.
16. Kiayias, A., and Yung, M. On crafty pirates and foxy tracers. In Digital Rights Management Workshop (2001), pp. 22-39.
17. Roth, A., and Roughgarden, T. Interactive privacy via the median mechanism. In STOC '10 (2010), pp. 765-774.
18. Tardos, G. Optimal probabilistic fingerprint codes. J. ACM 55, 2 (2008).
19. Thaler, J., Ullman, J., and Vadhan, S. P. Faster algorithms for privately releasing marginals. In ICALP (1) (2012), pp. 810-821.
20. 2+o(1) counting queries with differential privacy is hard. CoRR abs/1207.6945 (2012).
21. Ullman, J., and Vadhan, S. P. PCPs and the hardness of generating private synthetic data. In TCC '11 (2011), pp. 400-416.