TY - GEN

T1 - k-anonymization with minimal loss of information

AU - Gionis, Aristides

AU - Tassa, Tamir

PY - 2007

Y1 - 2007

N2 - The technique of k-anonymization allows the releasing of databases that contain personal information while ensuring some degree of individual privacy. Anonymization is usually performed by generalizing database entries. We formally study the concept of generalization, and propose two information-theoretic measures for capturing the amount of information that is lost during the anonymization process. Those measures are more general and more accurate than those proposed in [19] and [1]. We study the problem of achieving k-anonymity with minimal loss of information. We prove that it is NP-hard and study polynomial approximations for the optimal solution. Our first algorithm gives an approximation guarantee of O(ln k) - an improvement over the best-known O(k)-approximation of [1]. As the running time of the algorithm is O(n 2k), we also show how to adapt the algorithm of [1] in order to obtain an O(k)-approximation algorithm that is polynomial in both n and k.

AB - The technique of k-anonymization allows the releasing of databases that contain personal information while ensuring some degree of individual privacy. Anonymization is usually performed by generalizing database entries. We formally study the concept of generalization, and propose two information-theoretic measures for capturing the amount of information that is lost during the anonymization process. Those measures are more general and more accurate than those proposed in [19] and [1]. We study the problem of achieving k-anonymity with minimal loss of information. We prove that it is NP-hard and study polynomial approximations for the optimal solution. Our first algorithm gives an approximation guarantee of O(ln k) - an improvement over the best-known O(k)-approximation of [1]. As the running time of the algorithm is O(n 2k), we also show how to adapt the algorithm of [1] in order to obtain an O(k)-approximation algorithm that is polynomial in both n and k.

UR - http://www.scopus.com/inward/record.url?scp=38049064005&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75520-3_40

DO - 10.1007/978-3-540-75520-3_40

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:38049064005

SN - 9783540755197

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 439

EP - 450

BT - Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 15th Annual European Symposium on Algorithms, ESA 2007

Y2 - 8 October 2007 through 10 October 2007

ER -