TY - JOUR
T1 - Achieving anonymity via clustering
AU - Aggarwal, Gagan
AU - Feder, Tomás
AU - Kenthapadi, Krishnaram
AU - Khuller, Samir
AU - Panigrahy, Rina
AU - Thomas, Dilys
AU - Zhu, An
PY - 2010/6/1
Y1 - 2010/6/1
N2 - Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The κ-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or
AB - Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The κ-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or
KW - Anonymity
KW - Approximation algorithms
KW - Clustering
KW - Privacy
UR - http://www.scopus.com/inward/record.url?scp=77954396736&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954396736&partnerID=8YFLogxK
U2 - 10.1145/1798596.1798602
DO - 10.1145/1798596.1798602
M3 - Article
AN - SCOPUS:77954396736
SN - 1549-6325
VL - 6
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 3
M1 - 49
ER -