A learning theory approach to noninteractive database privacy

Journal of the ACM

Volumn 60, Issue 2, 2013, Pages

  Blum, Avrim ^a   Ligett, Katrina ^b   Roth, Aaron ^c  

^a Carnegie Mellon University ^*  (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Learning theory; Noninteractive database privacy

Indexed keywords

COMPUTATIONAL CONSTRAINTS; DIFFERENTIAL PRIVACIES; LEARNING THEORY; NON-INTERACTIVE DATABASE PRIVACY; POLYNOMIAL-TIME ALGORITHMS; PRIVACY PRESERVING; SMALL PERTURBATIONS; SYNTHETIC DATABASE;

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; POLYNOMIAL APPROXIMATION;

QUERY PROCESSING;

EID: 84877909042     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2450142.2450148     Document Type: Conference Paper

References (37)

1. ACHLIOPTAS, D. 2003. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. comput. Syst. Scie. 66, 4, 671-687.
2. ANTHONY, M. AND BARTLETT, P. 1999. Neural Network Learning: Theoretical Foundations. Cambridge University Press.
3. BALCAN, M. F., BLUM, A., AND VEMPALA, S. 2006. Kernels as features: On kernels, margins, and low-dimensional mappings. Mach. Learn. 65, 1, 79-94.
4. BLUM, A., DWORK, C., MCSHERRY, F., AND NISSIM, K. 2005. Practical privacy: The SuLQ framework. In Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM New York. 128-138.
5. BLUM, A., LIGETT, K., AND ROTH, A. 2008. A learning theory approach to non-interactive database privacy. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing. ACM, 609-618.
6. DASGUPTA, S. AND GUPTA, A. 1999. An elementary proof of the Johnson-Lindenstrauss Lemma. Tech. rep., 99-006, International Science Institute.
7. DE, A. 2011. Lower bounds in differential privacy. arXiv:1107.2183 (2011).
8. DINUR, I. AND NISSIM K. 2003. Revealing information while preserving privacy. In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). 202-210.
9. DWORK, C. 2006. Differential privacy. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 4052, Springer.
10. DWORK, C., KENTHAPADI, K., MCSHERRY, F., MIRONOV, I., AND NAOR, M. 2006a. Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology - EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, Springer, Berlin, 486-503.
11. DWORK C., MCSHERRY, F., NISSIM, K., AND SMITH, A. 2006b. Calibrating noise to sensitivity in private data analysis. In Proceedings of the 3rd Theory of Cryptography Conference (TCC) Lecture Notes in Computer Science, vol. 3876, Springer, 265.
12. Dwork, C., McSherry, F., and Talwar, K. 2007. The price of privacy and the limits of LP decoding. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 85-94.
13. DWORK, C., NAOR, M., REINGOLD, O., ROTHBLUM, G. N., AND VADHAN, S. 2009. On the complexity of differentially private data release: Efficient algorithms and hardness results. In Proceedings of the 41st Annual ACM Symposium on the Theory of Computing. ACM New York, 381-390.
14. DWORK, C. AND NISSIM, K. 2004. Privacy-preserving datamining on vertically partitioned databases. In Proceedings of CRYPTO. Lecture Notes in Computer Science, Springer, 528-544.
15. Dwork, C., Rothblum, G. N., and Vadhan, S. 2010. Boosting and differential privacy. In Proceedings of the 51st Annua IEEE Symposium on Foundations of Computer Science. IEEE, 51-60.
16. DWORK, C. AND YEKHANIN, S. 2008. New efficient attacks on statistical disclosure control mechanisms. In Proceedings of the Advances in Cryptology-CRYPTO 2008. 469-480.
17. GUPTA, A., HARDT, M., ROTH, A., AND ULLMAN, J. 2011a. Privately releasing conjunctions and the statistical query barrier. In Proceedings of the 43rd Annual ACM Symposium on the Theory of Computing. ACM New York.
18. GUPTA, A., ROTH, A., AND ULLMAN, J. 2011b. Iterative constructions and private data release. arXiv:1107.3731.
19. HARDT, M., LIGETT, K., AND MCSHERRY, F. 2012. A simple and practical algorithm for differentially private data release. arXiv:1012.4763.
20. HARDT, M. AND ROTHBLUM, G. N. 2010. A multiplicative weights mechanism for privacy-preserving data analysis. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science. IEEE, 61-70.
21. HARDT, M., ROTHBLUM, G. N., AND SERVEDIO, R. A. 2011. Private data release via learning thresholds. arXiv:1107.2444.
22. HARDT, M. AND TALWAR K. 2010. On the geometry of differential privacy. In Proceedings of the 42nd ACM Symposium on the Theory of Computing, (STOC'10).
23. HAY, M., RASTOGI, V., MIKLAU, G., AND SUCIU, D. 2010. Boosting the accuracy of differentially-private queries through consistency. In Proceedings of VLDB.
24. KASIVISWANATHAN, S. P., LEE, H. K., NISSIM, K., RASKHODNIKOVA, S., AND SMITH, A. 2008. What can we learn privately?. In Proceedings of the IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS'08). 531-540.
25. KASIVISWANATHAN, S. P., RUDELSON, M., SMITH, A., AND ULLMAN, J. 2010. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In Proceedings of the 42nd STOC. ACM.
26. LI, C., HAY, M., RASTOGI, V., MIKLAU, G., AND MCGREGOR, A. 2010. Optimizing linear counting queries under differential privacy. In Proceedings of PODS.
27. LI, C. AND MIKLAU, G. 2011. Efficient batch query answering under differential privacy. CoRR abs/1103.1367 (2011).
28. LI, C. AND MIKLAU, G. 2012a. An adaptive mechanism for accurate query answering under differential privacy. Proc. VLDB Endowment 5, 6, 514-525.
29. LI, C. AND MIKLAU, G. 2012b. Measuring the achievable error of query sets under differential privacy. CoRR abs/1202.3399v2.
30. MCSHERRY, F. AND TALWAR, K. 2007. Mechanism design via differential privacy. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS'07). 94-103.
31. MUTHUKRISHNAN, S. AND NIKOLOV, A. 2012. Optimal private halfspace counting via discrepancy. In Proceedings of STOC. 1285-1292.
32. ROTH, A. 2010. Differential privacy and the fat shattering dimension of linear queries. In Proceedings of the 14th Annual Workshop on Randomization and Computation (RANDOM'10).
33. ROTH, A. AND ROUGHGARDEN, T. 2010. Interactive privacy via the median mechanism. In Proceedings of the 42nd ACM Symposium on the Theory of Computing (STOC'10).
34. SMOLA, A. J. AND SCHÖLKOPF, B. 2002. Learning with Kernels. MIT Press.
35. ULLMAN, J. AND VADHAN, S. P. 2011. PCPs and the hardness of generating private synthetic data. In Proceedings of TCC. 400-416.
36. VAPNIK, V. N. 1998. Statistical Learning Theory. Wiley.
37. XIAO, X., WANG, G., AND GEHRKE, J. 2010. Differential privacy via wavelet transforms. IEEE Trans. Knowl. Data Eng. 1200-1214.