A critique of k-anonymity and some of its enhancements

被引：81

作者：

Domingo-Ferrer, Josep ^{[1
]}

Torra, Vicenc ^{[2
]}

机构：

[1] Univ Rovira & Virgili, UNESCO, Chair Data Privacy, Dept Comp Engn & Maths, Av Paisos Catalans 26, E-43007 Tarragona, Spain

[2] CSIC, IIIA, E-08193 Barcelona, Spain

来源：

ARES 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON AVAILABILITY, SECURITY AND RELIABILITY | 2008年

关键词：

D O I：

10.1109/ARES.2008.97

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does not always ensure privacy. A number of sophistications of k-anonymity have been proposed, like p-sensitive k-anonymity, l-diversity and t-closeness. This paper explores the shortcomings of those properties, none of which turns out to be completely convincing.

引用

页码：990 / +

页数：2

共 17 条

[1] [Anonymous], 12 ACM SIGKDD INT C, DOI DOI 10.1145/1150402.1150499
[2] [Anonymous], 2000, Privacy-preserving data mining, DOI DOI 10.1145/342009.335438
[3] Chor B., 1995, IEEE S FDN COMP SCI, P41
[4] Dalenius T., 1974, STAT TIDSKRIFT, V3, P213
[5] DALENIUS T, 1986, J OFF STAT, V2, P329
[6] Domingo-Ferrer J, 2007, LECT NOTES COMPUT SC, V4721, P193
[7] Lenz R., 2006, HDB STAT DISCLOSURE
[8] Li N., 2007, P IEEE ICDE 2007
[9] Lindell Y, 2000, LECT NOTES COMPUT SC, V1880, P36
[10] MACHANAVAJJHALA A, 2006, P IEEE ICDE 2006

← 1 2 →