Los Angeles, CA
March 31, 2009 to April 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.549
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.
privacy preserving, k-anonymity, generalization, incremental update, re-publication
Yingjie Wu, Zhihui Sun, Xiaodong Wang, "Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 53-60, doi:10.1109/CSIE.2009.549