This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Most of the previous works on k-anonymization focused on one-time release of data. However, data is often released continuously to serve various information purposes in reality. The purpose of this study is to develop an effective solution for the re-publication of incremental datasets. First, we analyze several possible generalizations in the anonymization for incremental updates and propose an important monotonic generalization principle that effectively prevents privacy breach in re-publication. Based on the monotonic generalization principle, we then propose a partitioning based algorithm for re-publication, which can securely anonymize a continuously growing dataset in an efficient manner while assuring high data quality. The effectiveness of our approach is confirmed by extensive experiments with real data.
Index Terms:
privacy preserving, k-anonymity, generalization, incremental update, re-publication
Citation:
Yingjie Wu, Zhihui Sun, Xiaodong Wang, "Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets," csie, vol. 4, pp.53-60, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.