Mondrian Multidimensional K-Anonymity
Top Cited Papers
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 25
- https://doi.org/10.1109/icde.2006.101
Abstract
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving anonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (single-dimensional) approaches. Often this flexibility leads to higher-quality anonymizations, as measured both by general-purpose metrics and more specific notions of query answerability. Optimal multidimensional anonymization is NP-hard (like previous optimal -anonymity problems). However, we introduce a simple greedy approximation algorithm, and experimental results show that this greedy algorithm frequently leads to more desirable anonymizations than exhaustive optimal algorithms for two single-dimensional models.Keywords
This publication has 8 references indexed in Scilit:
- IncognitoPublished by Association for Computing Machinery (ACM) ,2005
- Toward Privacy in Public DatabasesPublished by Springer Nature ,2005
- On the complexity of optimal K-anonymityPublished by Association for Computing Machinery (ACM) ,2004
- 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
- Transforming data to satisfy privacy constraintsPublished by Association for Computing Machinery (ACM) ,2002
- Protecting respondents identities in microdata releaseIEEE Transactions on Knowledge and Data Engineering, 2001
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977