TY - GEN
T1 - On t-closeness with KL-divergence and semantic privacy
AU - Sha, Chaofeng
AU - Li, Yi
AU - Zhou, Aoying
PY - 2010
Y1 - 2010
N2 - In this paper, we study how to sanitize the publishing data with sensitive attribute to achieve t-closeness and δ-disclosure privacy under Incognito framework. t-closeness is a privacy measure proposed to account for skewness attack and similarity attack, which are limitations of l-diversity. Under the t-closeness model, the distance between the privacy attribute distribution and the global one should be under the threshold t.Whereas semantic privacy (δ-disclosure privacy) is used to measure the incremental information gain fromthe anonymized tables. We use the Kullback-Leibler divergence to measure the distance between distributions and discuss the properties of the semantic privacy. We also study the relationship between t-closeness with KL-divergence and semantic privacy, and show that t-closeness with KL-divergence and δ-disclosure privacy satisfy the generalization property and the subset property, which entail us to use the Incognito algorithm. Experiments demonstrate the efficiency and effectiveness of our approaches.
AB - In this paper, we study how to sanitize the publishing data with sensitive attribute to achieve t-closeness and δ-disclosure privacy under Incognito framework. t-closeness is a privacy measure proposed to account for skewness attack and similarity attack, which are limitations of l-diversity. Under the t-closeness model, the distance between the privacy attribute distribution and the global one should be under the threshold t.Whereas semantic privacy (δ-disclosure privacy) is used to measure the incremental information gain fromthe anonymized tables. We use the Kullback-Leibler divergence to measure the distance between distributions and discuss the properties of the semantic privacy. We also study the relationship between t-closeness with KL-divergence and semantic privacy, and show that t-closeness with KL-divergence and δ-disclosure privacy satisfy the generalization property and the subset property, which entail us to use the Incognito algorithm. Experiments demonstrate the efficiency and effectiveness of our approaches.
UR - https://www.scopus.com/pages/publications/78650477209
U2 - 10.1007/978-3-642-12098-5_12
DO - 10.1007/978-3-642-12098-5_12
M3 - 会议稿件
AN - SCOPUS:78650477209
SN - 3642120970
SN - 9783642120978
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 153
EP - 167
BT - Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings
T2 - 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010
Y2 - 1 April 2010 through 4 April 2010
ER -