Data privacy through optimal k-anonymization

• Published in: 21st International Conference on Data Engineering (ICDE'05) pp. 217 - 228
• Main Authors: Bayardo, R.J., Rakesh Agrawal
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Costs; Data engineering; Data privacy; Frequency; Iterative algorithms; Machine learning; Machine learning algorithms; Proposals; Sorting; Stochastic processes
• ISBN: 0769522858; 9780769522852
• ISSN: 1063-6382
• DOI: 10.1109/ICDE.2005.42

Data de-identification reconciles the demand for release of data for research purposes and the demand for privacy from individuals. This paper proposes and evaluates an optimization algorithm for the powerful de-identification procedure known as k-anonymization. A k-anonymized dataset has the property that each record is indistinguishable from at least k - 1 others. Even simple restrictions of optimized k-anonymity are NP-hard, leading to significant computational challenges. We present a new approach to exploring the space of possible anonymizations that tames the combinatorics of the problem, and develop data-management strategies to reduce reliance on expensive operations such as sorting. Through experiments on real census data, we show the resulting algorithm can find optimal k-anonymizations under two representative cost measures and a wide range of k. We also show that the algorithm can produce good anonymizations in circumstances where the input data or input parameters preclude finding an optimal solution in reasonable time. Finally, we use the algorithm to explore the effects of different coding approaches and problem variations on anonymization quality and performance. To our knowledge, this is the first result demonstrating optimal k-anonymization of a non-trivial dataset under a general model of the problem.