The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 53-60
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
Zhihui Sun, Xiaodong Wang, Yingjie Wu, "Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets", Computer Science and Information Engineering, World Congress on, vol. 04, no. , pp. 53-60, 2009, doi:10.1109/CSIE.2009.549
89 ms
(Ver 3.3 (11022016))