An enhanced l-diversity privacy preservation

As a serious concern in data publishing and analysis, privacy preservation of individuals has received much attentions. Anonymity models via generalization can protect individual privacy, but often lead to superabundance information loss. Therefore, privacy preserving data publishing needs a careful balance between privacy protection and data utility. The challenge is how to lessen the information loss during anonymity. This paper presents a (k, l, θ)-diversity model base on clustering to minimize the information loss as well as assure data quality. We take into accounts the cluster size, the distinct sensitive attribute values and the privacy preserving degree for this model. Besides, we account for the complexity of our algorithm. Extensive experimental evaluation shows that our techniques clearly outperform the existing approaches in terms of execution time and data utility.

[1]  Adam Meyerson,et al.  On the complexity of optimal K-anonymity , 2004, PODS.

[2]  Josep Domingo-Ferrer,et al.  An Anonymity Model Achievable Via Microaggregation , 2008, Secure Data Management.

[3]  Josep Domingo-Ferrer,et al.  Efficient multivariate data-oriented microaggregation , 2006, The VLDB Journal.

[4]  Rajeev Motwani,et al.  Anonymizing Tables , 2005, ICDT.

[5]  Jian Pei,et al.  Utility-based anonymization using local recoding , 2006, KDD '06.

[6]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

[7]  Samir Khuller,et al.  Achieving anonymity via clustering , 2006, PODS '06.

[8]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[9]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[10]  Xin Jin,et al.  ASAP: Eliminating algorithm-based disclosure in privacy-preserving data publishing , 2011, Inf. Syst..

[11]  Ninghui Li,et al.  Towards optimal k-anonymization , 2008, Data Knowl. Eng..

[12]  Weining Zhang,et al.  Extending l-diversity to generalize sensitive data , 2011, Data Knowl. Eng..

[13]  Yufei Tao,et al.  The hardness and approximation algorithms for l-diversity , 2009, EDBT '10.

[14]  Chris Clifton,et al.  Thoughts on k-Anonymization , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[15]  Wendy Hui Wang,et al.  Privacy-preserving publishing microdata with full functional dependencies , 2011, Data Knowl. Eng..

[16]  Javier Herranz,et al.  On the disclosure risk of multivariate microaggregation , 2008, Data Knowl. Eng..

[17]  Daniel Kifer,et al.  Injecting utility into anonymized datasets , 2006, SIGMOD Conference.

[18]  Panos Kalnis,et al.  A framework for efficient data anonymization under privacy and accuracy constraints , 2009, TODS.

[19]  Murat Kantarcioglu,et al.  Formal anonymity models for efficient privacy-preserving joins , 2009, Data Knowl. Eng..