22nd International Conference on Data Engineering (ICDE'06) (2006)
Apr. 3, 2006 to Apr. 7, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.101
Kristen LeFevre , University of Wisconsin, Madison
David J. DeWitt , University of Wisconsin, Madison
Raghu Ramakrishnan , University of Wisconsin, Madison
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. <p>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.</p>
D. J. DeWitt, K. LeFevre and R. Ramakrishnan, "Mondrian Multidimensional K-Anonymity," 22nd International Conference on Data Engineering (ICDE'06)(ICDE), Atlanta, Georgia, 2006, pp. 25.