A Survey on Privacy Preserving Approaches in Data Publishing

被引:6
作者
Zhao, Yan [1 ]
Du, Ming [2 ]
Le, Jiajin [1 ]
Luo, Yongcheng [1 ]
机构
[1] Donghua Univ, Coll Informat Sci & Technol, Shanghai, Peoples R China
[2] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai, Peoples R China
来源
FIRST INTERNATIONAL WORKSHOP ON DATABASE TECHNOLOGY AND APPLICATIONS, PROCEEDINGS | 2009年
关键词
privacy preserving; data publishing; k-anonymity; homogeneity attack; inference channel;
D O I
10.1109/DBTA.2009.149
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Privacy preserving in data publishing has become one of the most important research topics in data security field and it has become a serious concern in publication of personal data in recent years. How to efficiently protect individual privacy in data publishing is especially critical. Thus, various proposals have been designed for privacy preserving in data publishing. In this paper, we summarize privacy preserving approaches in data publishing and survey current existing techniques, and analyze the advantage and disadvantage of these approaches. We divide these proposals into two categories, one is to achieve the purpose of privacy preserving based on k-anonymity model, and the other is to utilize the methods of probability or statistics to protect data privacy in the case of the statistical properties of the final data and classification properties are unchanged. For example, clustering, randomization approaches. Finally, we discuss the future directions of privacy preserving in data publishing.
引用
收藏
页码:128 / +
页数:2
相关论文
共 26 条
[1]  
AGGARWAL G, 2006, 25 ACM SIGMOD SIGACT
[2]   Privacy Preserving Serial Data Publishing By Role Composition [J].
Bu, Yingyi ;
Fu, Ada Wai Chee ;
Wong, Raymond Chi Wing ;
Chen, Lei ;
Li, Jiuyong .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (01) :845-856
[3]  
Byun JW, 2007, LECT NOTES COMPUT SC, V4443, P188
[4]  
DUTTA H, 2003, P 2003 ACM WORKSH PR, P31
[5]  
Huang Z., 2005, P 2005 ACM SIGMOD IN, P37, DOI DOI 10.1145/1066157.1066163
[6]   Extensions to the k-means algorithm for clustering large data sets with categorical values [J].
Huang, ZX .
DATA MINING AND KNOWLEDGE DISCOVERY, 1998, 2 (03) :283-304
[7]  
Jensen C., 2004, P SIGCHI C HUM FACT, V6, P471, DOI DOI 10.1145/985692.985752
[8]  
KARGUPTA H, 2005, KNOWLEDGE INFORM MAY, P387
[9]  
Kargupta H., 2003, P 3 IEEE INT C DAT M
[10]  
KUNDU A, VLDB 2008, P138