loading...
A Multi-Dimensional K-Anonymity Model for Hierarchical Data
August 03-August 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISECS.2008.1132008 International Symposium on Elect ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
For improving the usability of the anonymous result, it is important to comply with the hierarchical structure when generalizing quasi-identifying attributes with hierarchical characteristics. We propose an unrestricted multi-dimensional anonymization model which combines global recoding and local recoding methods. The bottom-up anonymization algorithm with the minimal coverage subgraph constraint and the anonymization metric are proposed. The experiment results justify the effectiveness and scalability of this model.
Citation:
Xiaojun Ye, Lei Jin, Bin Li, "A Multi-Dimensional K-Anonymity Model for Hierarchical Data," isecs, pp.327-332, 2008 International Symposium on Electronic Commerce and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.