A Personalized (a,k)-Anonymity Model
Authors:
- Xiaojun YeXYXiaojun Ye
- Yawei ZhangYZYawei Zhang
- Ming LiuMLMing Liu
- 1 July 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 341-348
Abstract
One important privacy principle is that an individual has the freedom to decide his/her own privacy preferences, which should be taken into account when data holders release their privacy preserving micro data. Nevertheless, current related k-anonymity model research focuses on protecting individual private information by using pre-defined constraint parameters specified by data holders. This paper introduces a personalized (alpha, k) model by introducing a vector for describing individual personalized privacy requirements corresponding to each value in the domain of sensitive attributes by data respondents, and propose an efficiency anonymization algorithm which combines the top down specialization for quasi-identifier anonymization and the local recoding technique for the sensitive attribute generalization based on its attribute taxonomy tree. Experimental results show that this approach can meet better personalized privacy requirements and keep the information loss low.Keywords
This publication has 10 references indexed in Scilit:
- t-Closeness: Privacy Beyond k-Anonymity and l-Diversity2007
- (α, k)-anonymity2006
- Personalized privacy preservation2006
- L-diversity: privacy beyond k-anonymity2006
- Mondrian Multidimensional K-Anonymity2006
- Thoughts on k-Anonymization2006
- Incognito2005
- Top-Down Specialization for Information and Privacy Preservation2005
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Privacy as a Matter of Taste and RightSocial Philosophy and Policy, 2000