Abstract | ||
---|---|---|
In some applications of privacy preserving data publishing, a practical demand is to publish a data set on multiple quasi-identifiers for multiple users simultaneously, which poses several challenges. Can we generate one anonymized version of the data so that the privacy preservation requirement like $k$-anonymity is satisfied for all users and the information loss is reduced as much as possible? In this paper, we identify and tackle the novel problem by an elegant solution.The full paper is available at http://www.cs.sfu.ca/~jpei/publications/butterfly-tr.pdf |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/ICDE.2009.183 | ICDE |
Keywords | Field | DocType |
multiple quasi-identifiers,anonymized version,data publishing,elegant solution,multiple user,practical demand,information loss,privacy preserving publishing,privacy preservation requirement,full paper,satisfiability,uncertainty,publishing,privacy,data privacy,silicon,user interfaces | Quasi identifier,Publication,Data mining,World Wide Web,Information loss,Identifier,Computer science,Data publishing,Publishing,Information privacy,User interface,Database | Conference |
ISSN | Citations | PageRank |
1084-4627 | 6 | 0.60 |
References | Authors | |
4 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jian Pei | 1 | 19002 | 995.54 |
Yufei Tao | 2 | 7231 | 316.71 |
Jiexing Li | 3 | 211 | 10.36 |
Xiaokui Xiao | 4 | 3266 | 142.32 |