Efficient anonymizations with enhanced utility

Transactions on Data Privacy

Volumn 3, Issue 2, 2010, Pages 149-175

  Goldberger, Jacob ^a   Tassa, Tamir ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

diversity; Clustering; k anonymity; Mutual information; Privacy preserving data mining

Indexed keywords

EFFICIENT ALGORITHM; EXPERIMENTAL COMPARISON; K-ANONYMITY; K-ANONYMIZATION; MUTUAL INFORMATIONS; PRIVACY PRESERVATION; PRIVATE DATA; PUBLIC DATA; SECURITY MEASURE; UTILITY MEASURE;

DATA MINING; DATA PRIVACY; INFORMATION THEORY;

CLUSTERING ALGORITHMS;

EID: 78651539208     PISSN: 18885063     EISSN: 20131631     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu. Achieving anonymity via clustering. In PODS, 2006.
2. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k-anonymity. J. of Privacy Tech., 2005.
3. R. Agrawal and R. Srikant. Privacy-preserving data mining. ACM SIGMOD Record, 29(2), 2000.
4. R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE, 2005.
5. J.W. Byun, A. Kamra, E. Bertino, and N. Li. Efficient k-anonymization using clustering techniques. In DASFAA, 2007.
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley, New York, 1991.
7. J. Domingo-Ferrer and V. Torra. A critique of k-anonymity and some of its enhancements. In ARES, 2008.
8. G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis. A framework for efficient data anonymization under privacy and accuracy constraints. ACM Trans. Database Syst., 34, 2009.
9. A. Gionis, A. Mazza, and T. Tassa. k-Anonymization revisited. In ICDE, 2008.
10. A. Gionis and T. Tassa. k-Anonymization with minimal loss of information. IEEE Trans. Knowl. Data Eng., 21, 2009.
11. V. Iyengar. Transforming data to satisfy privacy constraints. In SIGKDD, 2002.
12. B. Kenig and T. Tassa. A practical approximation algorithm for optimal k-anonymity. Submitted.
13. D. Kifer and J. Gehrke. Injecting utility into anonymized datasets. In ICDM, 2006.
14. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: efficient full-domain k-anonymity. In ACM-SIGMOD International Conference on Management of Data (SIGMOD), pages 49-60, 2005.
15. K. LeFevre, David J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In International Conference on Data Engineering (ICDE), 2006.
16. S.P. Lloyd. Least square quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-137,1982.
17. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-Diversity: privacy beyond k-anonymity. In ICDE, 2006.
18. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS, 2004.
19. B. Moon, H. Jagadish, and C. Faloutsos. Analysis of the clustering properties of the Hilbert space-filling curve. The New England Journal of Medicine, 13(1):124-141, 2001.
20. M. E. Nergiz and C. Clifton. Thoughts on k-anonymization. In ICDE Workshops, 2006.
21. H. Park and K. Shim. Approximate algorithms for k-anonymity. In SIGMOD, 2007.
22. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In PODS, 1998.
23. N. Slonim, N. Friedman, and N. Tishby. Unsupervised document classification using sequential information maximization. In ACM SIGIR, 2002.
24. T. Tassa, I. Tamir, and E. Gudes. Secure distributed computation of anonymized views of shared databases. Submitted.
25. R.C.W. Wong, J. Li, A.W.C. Fu, and K. Wang. (α, k)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing. In KDD, pages 754-759, 2006.
26. X. Xiao and Y. Tao. Anatomy: Simple and Effective Privacy Preservation. In International Conference on Very Large Data Bases (VLDB), 2006.