loading...
Towards the Diversity of Sensitive Attributes in k-Anonymity
Hong Kong, China December 18-December 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WI-IATW.2006.1352006 IEEE/WIC/ACM International Confe ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Min Wu, Tsinghua University, China
Xiaojun Ye, Tsinghua University, China
Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class.
Citation:
Min Wu, Xiaojun Ye, "Towards the Diversity of Sensitive Attributes in k-Anonymity," wi-iatw, pp.98-104, 2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops, 2006
Usage of this product signifies your acceptance of the Terms of Use.