Can the Utility of Anonymized Data be Used for Privacy Breaches?

被引:65
作者
Wong, Raymond Chi-Wing [1 ]
Fu, Ada Wai-Chee [2 ]
Wang, Ke [3 ]
Yu, Philip S. [4 ]
Pei, Jian [3 ]
机构
[1] Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R China
[2] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China
[3] Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada
[4] Univ Illinois, Chicago, IL 60680 USA
基金
加拿大自然科学与工程研究理事会;
关键词
Privacy preservation; data publishing; l-diversity; k-anonymity; BACKGROUND KNOWLEDGE;
D O I
10.1145/1993077.1993080
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Group based anonymization is the most widely studied approach for privacy-preserving data publishing. Privacy models/definitions using group based anonymization includes k-anonymity, l-diversity, and t-closeness, to name a few. The goal of this article is to raise a fundamental issue regarding the privacy exposure of the approaches using group based anonymization. This has been overlooked in the past. The group based anonymization approach by bucketization basically hides each individual record behind a group to preserve data privacy. If not properly anonymized, patterns can actually be derived from the published data and be used by an adversary to breach individual privacy. For example, from the medical records released, if patterns such as that people from certain countries rarely suffer from some disease can be derived, then the information can be used to imply linkage of other people in an anonymized group with this disease with higher likelihood. We call the derived patterns from the published data the foreground knowledge. This is in contrast to the background knowledge that the adversary may obtain from other channels, as studied in some previous work. Finally, our experimental results show such an attack is realistic in the privacy benchmark dataset under the traditional group based anonymization approach.
引用
收藏
页数:24
相关论文
共 33 条
[1]   On unifying privacy and uncertain data models [J].
Aggarwal, Charu C. .
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, :386-395
[2]  
Aggarwal CharuC., 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06, P510, DOI DOI 10.1145/1150402.1150460
[3]  
Aggarwal G, 2005, LECT NOTES COMPUT SC, V3363, P246
[4]  
[Anonymous], 2006, P 32 INT C VER LARG
[5]  
[Anonymous], 2005, P 2005 ACM SIGMOD IN
[6]  
[Anonymous], 2008, P 14 ACM SIGKDD INT, DOI DOI 10.1145/1401890.1401904
[7]  
Antova L., 2007, Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering (ICDE'07), P606
[8]  
Blake E.K., 1998, UCI REPOSITORY MACHI
[9]  
Brin S., 1997, P 1997 ACM SIGMOD IN, P265
[10]  
BURDICK D., 2005, P INT C VER LARG DAT, P123