Anonymizing tables

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

Volumn 3363 LNCS, Issue , 2005, Pages 246-258

  Aggarwal, Gagan ^a   Feder, Tomás ^a   Kenthapadi, Krishnaram ^a   Motwani, Rajeev ^a   Panigrahy, Rina ^a   Thomas, Dilys ^a   Zhu, An ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; DATA INTEGRITY; INDIVIDUAL PRIVACY; K-ANONYMITY; K-ANONYMIZATION; NP-HARD; RELATIONAL DATABASE; SPECIFIC VALUES;

COMPUTATIONAL COMPLEXITY; DATA PRIVACY; DATABASE SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 77049087087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_17     Document Type: Conference Paper

References (17)

1. D. Agrawal and C. Aggarwal. On the design and quantification of privacy preserving datamining algorithms. In Proc. of the ACM Symp. on Principles of Database Systems, 2001.
2. G. Aggarwal, N. Mishra, and B. Pinkas. Privacy preserving computation of the k-th ranked element. In EUROCRYPT, 2004.
3. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 439-450, May 2000.
4. R. Agrawal, R. Srikant, and D. Thomas. Privacy preserving aggregates. Technical report, Stanford University, 2003.
5. G. P. Cornuejols. General factors of graphs. In Journal of Combinatorial Theory B 45, pages 185-198, 1988.
6. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. of the ACM Symp. on Principles of Database Systems, pages 202-210, 2003.
7. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, 2004.
8. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proc. of the ACM Symp. on Principles of Database Systems, June 2003.
9. European Union. Directive on Privacy Protection, October 1998.
10. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In EUROCRYPT, 2004.
11. V. Kann. Maximum bounded H-matching is MAX SNP-complete. In Information Processing Letters, 49, pages 309-318, 1994.
12. Y. Lindell and B. Pinkas. Privacy preserving data mining. In CRYPTO, pages 36-54, 2000.
13. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In Proc. of the ACM Symp. on Principles of Database Systems, June 2004.
14. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In Proc. of the ACM Symp. on Principles of Database Systems, page 188, 1998.
15. L. Sweeney. Uniqueness of simple demographics in the U.S. population. In LIDAP-WP4. Carnegie Mellon University, Laboratory for International Data Privacy, Pittsburgh, PA, 2000.
16. L. Sweeney. k-Anonymity: A model for protecting privacy. In International Journal on Uncertainty Fuzziness Knowledge-based Systems, June 2002.
17. Time. The Death of Privacy, August 1997.