Published Articles >> Table of Contents >> Abstract

19th International Conference on Scientific and Statistical Database Management (SSDBM 2007)   p. 5
Maintaining K-Anonymity against Incremental Updates
1 Pei, Simon Fraser University, Canada
1 Xu, Fudan University, China
1 Wang, Fudan University, China
1 Wang, Fudan University, China
1 Wang, Simon Fraser University, Canada

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SSDBM.2007.16
Send link to a friend

Abstract
K-anonymity is a simple yet practical mechanismto protect privacy against attacks of re-identifying individuals by joining multiple public data sources. All existing methods achieving k-anonymity assume implicitly that the data objects to be anonymized are given once and fixed. However, in many applications, the real world data sources are dynamic. In this paper, we investigate the problem of maintaining k-anonymity against incremental updates, and propose a simple yet effective solution. We analyze how inferences from multiple releases may temper the k-anonymity of data, and propose the monotonic incremental anonymization property. The general idea is to progressively and consistently reduce the generalization granularity as incremental updates arrive. Our new approach guarantees the k-anonymity on each release, and also on the inferred table using multiple releases. At the same time, our new approach utilizes the more and more accumulated data to reduce the information loss.
Back to Top Additional Information
Citation:  1 Pei, 1 Xu, 1 Wang, 1 Wang, 1 Wang, "Maintaining K-Anonymity against Incremental Updates," ssdbm, p. 5,  19th International Conference on Scientific and Statistical Database Management (SSDBM 2007),  2007