Differential privacy and the fat-shattering dimension of linear queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 683-695

  Roth, Aaron ^a,b  

^a Carnegie Mellon University   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149311849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_51     Document Type: Conference Paper

References (18)

1. Alon, N., Ben David, S., Cesa Bianchi, N., Haussler, D.: Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the ACM (JACM) 44(4), 615-631 (1997) (Pubitemid 127617707)
2. Beimel, A., Kasiviswanathan, S., Nissim, K.: Bounds on the sample complexity for private learning and private data release. In: Micciancio, D. (ed.) Theory of Cryptography. LNCS, vol. 5978, pp. 437-454. Springer, Heidelberg (2010)
3. Bartlett, P.L., Long, P.M.: More theorems about scale-sensitive dimensions and learning. In: Proceedings of the eighth annual conference on Computational learning theory, pp. 392-401. ACM, New York (1995)
4. Blum, A., Ligett, K., Roth, A.: A learning theory approach to noninteractive database privacy. In: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 609-618. ACM, New York (2008)
5. Bartlett, P.L., Long, P.M., Williamson, R.C.: Fat-shattering and the learnability of real-valued functions. In: Proceedings of the seventh annual conference on Computational learning theory, pp. 299-310. ACM, New York (1994)
6. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265-284. Springer, Heidelberg (2006) (Pubitemid 43979853)
7. Dwork, C., McSherry, F., Talwar, K.: The price of privacy and the limits of LP decoding. In: Proceedings of the thirty-ninth annual ACM Symposium on Theory of Computing, p. 94. ACM, New York (2007)
8. Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 202-210 (2003)
9. Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: 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, pp. 381-390. ACM, New York (2009)
10. Dwork, C., Yekhanin, S.: New efficient attacks on statistical disclosure control mechanisms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 469-480. Springer, Heidelberg (2008)
11. Hardt, M., Talwar, K.: On the Geometry of Differential Privacy. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)
12. Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What Can We Learn Privately? In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 531-540 (2008)
13. Kasiviswanathan, S., Rudelson, M., Smith, A., Ullman, J.: The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)
14. Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts*. Journal of Computer and System Sciences 48(3), 464-497 (1994)
15. McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual Symposium on Foundations of Computer Science (2007)
16. Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. Association for Computing Machinery, Inc., New York (2007)
17. Roth, A., Roughgarden, T.: Interactive Privacy via the Median Mechanism. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)
18. Ullman, J., Vadhan, S.: PCPs and the Hardness of Generating Synthetic Data (manuscript) (2010)