A Critique of k-Anonymity and Some of Its Enhancements
Authors:
- Josep Domingo-FerrerJDJosep Domingo-Ferrer
- Vicenç TorraVTVicenç Torra
- 1 March 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 990-993
Abstract
k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does not always ensure privacy. A number of sophistications of k-anonymity have been proposed, like p-sensitive k-anonymity, l-diversity and t-closeness. This paper explores the shortcomings of those properties, none of which turns out to be completely convincing.Keywords
This publication has 10 references indexed in Scilit:
- t-Closeness: Privacy Beyond k-Anonymity and l-Diversity2007
- A Three-Dimensional Conceptual Framework for Database Privacy2007
- L-diversity: privacy beyond k-anonymity2006
- Privacy Protection: p-Sensitive k-Anonymity Property2006
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSIONInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Elements of Statistical Disclosure Control2001
- Protecting respondents identities in microdata releaseIEEE Transactions on Knowledge and Data Engineering, 2001
- Privacy Preserving Data Mining2000
- Privacy-preserving data miningACM SIGMOD Record, 2000