作者
Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian
发表日期
2006/4/15
研讨会论文
2007 IEEE 23rd international conference on data engineering
页码范围
106-115
出版商
IEEE
简介
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain "identifying" attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of l-diversity has been proposed to address this; l-diversity requires that each equivalence class has at least l well-represented values for each sensitive attribute. In this paper we show that l-diversity has a number of limitations. In particular, it is neither necessary nor sufficient to prevent attribute disclosure. We propose a novel privacy notion called t-closeness, which requires that the distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a …
引用总数
20072008200920102011201220132014201520162017201820192020202120222023202437107137195186205256277257279346366398417418387342135
学术搜索中的文章
N Li, T Li, S Venkatasubramanian - 2007 IEEE 23rd international conference on data …, 2006
N Li, T Li, S Venkatasubramanian - Proceedings of the 23rd International Conference on …, 2007