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 条

[1]

Muralidhar K., Sarathy R., Security of random data perturbation methods, ACM Trans on Database Systems, 24, 4, pp. 487-493, (1999)

[2]

Kargupta H., Datta S., Wang Q., Et al., On the privacy preserving properties of random data perturbation techniques, Proc of the 3rd Int Conf on Data Mining, pp. 99-106, (2003)

[3]

Chen K., Liu L., Privacy preserving data classification with rotation perturbation, Proc of the 5th Int Conf on Data Mining, (2005)

[4]

Aggarwal C.C., Philip S.Y., A condensation approach to privacy preserving data mining, Proc of Int Conf on Extending Database Technology, pp. 183-199, (2004)

[5]

Aggarwal C.C., Yu P.S., On static and dynamic methods for condensation-based privacy-preserving data mining, ACM Trans on Database Systems, 33, 1, pp. 41-79, (2008)

[6]

Evfimievski A., Srikant R., Agrawal R., Et al., Privacy preserving mining of association rules, Information Systems, 29, 4, pp. 343-364, (2004)

[7]

Zhang X., Wu Y., Wang X., Differential privacy data release through adding noise on average value[G], Network and System Security, pp. 417-429, (2012)

[8]

Dwork C., McSherry F., Nissim K., Et al., Calibrating noise to sensitivity in private data analysis[G], Theory of Cryptography, pp. 265-284, (2006)

[9]

Li M., Sampigethaya K., Huang L., Et al., Swing & swap: User-centric approaches towards maximizing location privacy, Proc of the 5th ACM Workshop on Privacy in Electronic Society, pp. 19-28, (2006)

[10]

Sweeney L., k-anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10, 5, pp. 557-570, (2002)

← 1 2 3 →