Toward privacy in public databases

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 363-385

  Chawla, Shuchi ^a   Dwork, Cynthia ^b   McSherry, Frank ^b   Smith, Adam ^c   Wee, Hoeteck ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CRYPTOGRAPHY; FUNCTION EVALUATION; PROBLEM SOLVING; SECURITY OF DATA;

CLUSTERING; SANITIZATION TECHNIQUES; STATISTICAL DATABASES;

DATABASE SYSTEMS;

EID: 24144487020     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_20     Document Type: Conference Paper

References (35)

1. D. Agrawal and C. Aggarwal, On the Design and Quantification of Privacy Preserving Data Mining Algorithms, Proceedings of the 20th Symposium on Principles of Database Systems, 2001.
2. N. R. Adam and J. C. Wortmann, Security-Control Methods for Statistical Databases: A Comparative Study, ACM Computing Surveys 21(4): 515-556 (1989).
3. S. Arora and R. Kannan. Learning mixtures of arbitrary Gaussians. ACM STOC, 2001.
4. R. Agrawal and R. Srikant, Privacy-preserving data mining, Proc. of the ACM SIGMOD Conference on Management of Data, pp. 439-450, 2000.
5. Beck, L., A security machanism for statistical database, ACM Transactions on Database Systems (TODS), 5(3), p.316-3338, 1980.
6. Chawla S., Dwork, C., McSherry, F., Talwar, K., On the Utility of Privacy-Preserving Histograms, in preparation, November, 2004.
7. Cox, L. H., New Results in Disclosure Avoidance for Tabulations, International Statistical Institute Proceedings of the 46th Session, Tokyo, 1987, pp. 83-84.
8. S. Dasgupta, Learning mixtures of Gaussians, IEEE FOCS, 1999.
9. Denning, D., Secure statistical databases with random sample queries, ACM Transactions on Database Systems (TODS), 5(3), p.291-315, 1980.
10. P. Diaconis and B. Sturmfels, Algebraic Algorithms for Sampling from Conditional Distributions, Annals of Statistics 26(1), pp. 363-397, 1998
11. I. Dinur and K. Nissim, Revealing information while preserving privacy, Proceedings of the Symposium on Principles of Database Systems, pp. 202-210, 2003.
12. A. Dobra and S.E. Fienberg, and M. Trottini, Assessing the risk of disclosure of confidential categorical data, Bayesian Statistics 7, pp. 125-14, Oxford University Press, 2000.
13. C. Dwork, A Cryptography-Flavored Approach to Privacy in Public Databases, lecture at Aladdin Workshop on Privacy in DATA, March, 2003; http://www.aladdin.cs.cmu.edu/workshops/privacy/slides/pdf/dwork.pdf)
14. C. Dwork, M. Naor, et al., Impossibility Results for Privacy-Preserving Data Sanitization, in preparation, 2004.
15. C. Dwork and K. Nissim, Privacy-Preserving Datamining on Vertically Partitioned Databases, Proc. CRYPTO 2004.
16. A. V. Evfimievski, J. Gehrke and R. Srikant, Limiting privacy breaches in privacy preserving data mining, Proceedings of the Symposium on Principles of Database Systems, pp. 211-222, 2003.
17. Füredi, Zoltán and Komlós, János, The eigenvalues of random symmetric matrices, Combinatorica, 1:3, 1981, pages 233-241.
18. W. Gasarch, A Survey on Private Information Retrieval. BEATCS Computational Complexity Column, 82, pp. 72-107, Feb 2004.
19. R. Gavison, Privacy and the Limits of the Law, in Deborah G. Johnson and Helen Nissenbaum, editors, Computers, Ethics, and Social Values, pp. 332-351. Prentice Hall, 1995.
20. O. Goldreich, The Foundations of Cryptography - Volume 2. Cambridge University Press, 2004.
21. S. Goldwasser and S. Micali, Probabilistic Encryption, JCSS 28(2), pp. 270-299, 1984.
22. D. Gusfield, A Graph Theoretic Approach to Statistical Data Security, SIAM Journal on Computing 17(3), pp. 552-571, 1988
23. P. Indyk and R. Motwani. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998.
24. H. Kargupta, S. Datta, Q. Wang, K. Sivakumar. On the Privacy Preserving Properties of Random Data Perturbation Techniques. Proceedings of the Third ICDM IEEE International Conference on Data Mining, 2003.
25. J. M. Kleinberg, C. H. Papadimitriou, and P. Raghavan, Auditing Boolean Attributes, J. Comput. Syst. Sci. 66(1), pp. 244-253, 2003
26. F. McSherry, Spectral Partitioning of Random Graphs, Proc. 42nd FOCS, pp. 529-537, 2001
27. T.E. Raghunathank, J.P. Reiter, and D.B. Rubin, Multiple Imputation for Statistical Disclosure Limitation, J. Official Statistics 19(1), 2003, pp. 1-16.
28. G. Roque. Application and Analysis of the Mixture-of-Normals Approach to Masking Census Public-use Microdata. Manuscript, 2003.
29. D. B. Rubin, Discussion: Statistical Disclosure Limitation, Journal of Official Statistics 9(2), 1993, pp. 461-468.
30. Sibson, R, SLINK: an optimally efficient algorithm for the single-link cluster method, In the Computer Journal Vol. 16, No. 1, 1973, pages 30-34.
31. L. Sweeney, k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10 (5), 2002; 557-570.
32. L. Sweeney, Achieving k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10 (5), 2002; 571-588.
33. S. Vempala and G. Wang, A spectral algorithm for learning mixtures of distributions, IEEE FOCS, 2002.
34. W. E. Winkler. Masking and Re-identification Methods for Public-Use Microdata: Overview and Research Problems. In Proc. Privacy in Statistical Databases 2004, Springer LNCS 3050.
35. W. E. Winkler. Re-identification Methods for Masked Microdata. In Proc. Privacy in Statistical Databases 2004, Springer LNCS 3050.