Privacy preserving data publishing via weighted Bayesian networks

被引:0
作者
Wang L. [1 ,2 ]
Wang W. [1 ]
Meng D. [1 ]
机构
[1] Institute of Information Engineering, Chinese Academy of Sciences, Beijing
[2] University of Chinese Academy of Sciences, Beijing
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2016年 / 53卷 / 10期
基金
国家高技术研究发展计划(863计划);
关键词
Bayesian network; Data privacy; Data publishing; Differential privacy; Privacy preserving;
D O I
10.7544/issn1000-1239.2016.20160465
中图分类号
学科分类号
摘要
Privacy preserving in data publishing is a hot topic in the field of information security currently. How to effectively prevent the disclosure of sensitive information has become a major issue in enabling public access to the published dataset that contain personal information. As a newly developed notion of privacy preserving, differential privacy can provide strong security protection due to its greatest advantage of not making any specific assumptions on the attacker's background, and has been extensively studied. The existing approaches of differential privacy cannot fully and effectively solve the problem of releasing high-dimensional data. Although the PrivBayes can transform high-dimensional data to low-dimensional one, but cannot prevent attributes disclosure on certain conditions, and also has some limitations and shortcomings. In this paper, to solve these problems, we propose a new and powerful improved algorithm for data publishing called weighted PrivBayes. In this new algorithm, thorough both theoretical analysis and experiment evaluation, not only guarantee the security of the published dataset but also significantly improve the data accuracy and practical value than PrivBayes. © 2016, Science Press. All right reserved.
引用
收藏
页码:2343 / 2353
页数:10
相关论文
共 30 条
[11]  
Sweeney L., Achieving k-anonymity privacy protection using generalization and suppression, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10, 5, pp. 571-588, (2002)
[12]  
Wong R.C.W., Li J., Fu A.W.C., Et al., (α, k)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing, Proc of the 12th Int Conf on Knowledge Discovery and Data Mining, pp. 754-759, (2006)
[13]  
Xiao X., Tao Y., Personalized privacy preservation, Proc of the 2006 Int Conf on Management of Data, pp. 229-240, (2006)
[14]  
Machanavajjhala A., Kifer D., Gehrke J., Et al., l-diversity: Privacy beyond k-anonymity, ACM Trans on Knowledge Discovery from Data, 1, 1, (2007)
[15]  
Li N., Li T., Venkatasubramanian S., t-closeness: Privacy beyond k-anonymity and l-diversity, Proc of the 23rd Int Conf on Data Engineering, pp. 106-115, (2007)
[16]  
Xiao X., Wang G., Gehrke J., Differential privacy via wavelet transforms, IEEE Trans on Knowledge and Data Engineering, 23, 8, pp. 1200-1214, (2011)
[17]  
Barak B., Chaudhuri K., Dwork C., Et al., Privacy, accuracy, and consistency too: A holistic solution to contingency table release, Proc of the 26th Symp on Principles of Database Systems, pp. 273-282, (2007)
[18]  
LeFevre K., DeWitt D.J., Ramakrishnan R., Incognito: Efficient full-domain k-anonymity, Proc of the 2005 Int Conf on Management of Data, pp. 49-60, (2005)
[19]  
Xiao X., Wang G., Gehrke J., Interactive anonymization of sensitive data, Proc of the 2009 Int Conf on Management of Data, pp. 1051-1054, (2009)
[20]  
McSherry F., Talwar K., Mechanism design via differential privacy, Proc of the 48th Annual IEEE Symp on Foundations of Computer Science, pp. 94-103, (2007)