Utility Optimal Model for Differential Privacy Based on the Rate Distortion

被引:0
作者
Wu N.-B. [1 ]
Peng C.-G. [1 ,2 ]
Tian Y.-L. [1 ,2 ]
Niu K. [1 ]
Ding H.-F. [2 ,3 ]
机构
[1] State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang
[2] Institute of Cryptography and Data Security, Guizhou University, Guiyang
[3] College of Information, Guizhou University of Finance and Economics, Guiyang
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2020年 / 43卷 / 08期
基金
中国国家自然科学基金;
关键词
Data utility optimization; Differential privacy; Mutual information privacy leakage; Privacy-utility tradeoff; Rate-distortion function;
D O I
10.11897/SP.J.1016.2020.01463
中图分类号
学科分类号
摘要
Privacy leakage has become a widely concerned issue and a major restricting factor for data releasing and sharing in the era of big data. This issue urgently needs effective privacy preserving mechanism to protect individual's private information while preserving the accuracy of released data. Commonly, the privacy-preserving data release is achieved by data distortion disturbance. Indeed, this will raise a problem of tradeoff between privacy protection intensity and the degree of data distortion, that is known as the problem of privacy-utility tradeoff. Recently years, the issue of privacy-utility tradeoff has become a hot topic in the field of privacy. Additionally, differential privacy (DP) as a strict privacy protection technology has been widely studied by researchers. The basic idea of DP is randomized perturbation for the purpose to release noisy data. Thus, the privacy-utility tradeoff is still the key research of differential privacy. In this paper, we mainly focus on the scenario of differential privacy offline data release. Based on Shannon's communication theory, we adopt privacy spread communication model to simulate data releasing and model the randomized perturbation of differential privacy as a noisy channel model, i.e., a randomized probability mapping. Further, we adopt mutual information and expected distortion measure function to quantify privacy leakage and data usability. Thus, the problem of tradeoff between privacy and utility can be formalized as mutual information privacy optimization problem, which can be solved by celebrated rate-distortion theory. In this regard, Wang et al presented the mutual information privacy (PD-MIP), and utilized Karush-Kuhn-Tucker (KKT) condition to illustrate optimality criterion of mutual information privacy. And then, they proved that the optimal mutual information privacy also is close to the optimal differential privacy level when given a distortion constraint. Besides, Kalantari also pointed out that differential privacy leakage is the upper bound of mutual information privacy leakage. These researches establish a fundamental relation between mutual information privacy and differential privacy. However, they do not consider that how to obtain the optimal mutual information privacy mechanism, and the impact of related data on mutual information privacy leakage. That is, the data association of auxiliary background knowledge can help to obtain more private information, thus leading to the inference of individual's privacy with higher probability. Therefore, it is meaningful to study the impact of related data on mutual information privacy leakage. To address the problem mentioned above, we consider the influence of auxiliary background knowledge on the mutual information privacy leakage, and propose mutual information privacy metric based on joint events. Furthermore, we modify the current rate-distortion function, and propose a minimized mutual information privacy disclosure model. Finally, for the difficult problem of computing rate-distortion by using the Lagrange approach, we propose an approximate algorithm of differential privacy optimization channel mechanism based on the principle of Blahut-Arimoto algorithm. We verify the effectiveness of the proposed iterative approximate computation. The experimental results show that the amount of mutual information privacy disclosure is 21.7% which is lower than that in symmetric discrete channel mechanism under the condition of limited distortion. Meanwhile, the data utility improves 38.3% under the same privacy tolerance. © 2020, Science Press. All right reserved.
引用
收藏
页码:1463 / 1478
页数:15
相关论文
共 36 条
[1]  
Dwork C., Differential privacy, Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming- Volume Part II (ICALP), pp. 1-12, (2006)
[2]  
Zhu T, Li G, Zhou W, Et al., Differentially private data publishing and analysis: A survey, IEEE Transactions on Knowledge and Data Engineering, 29, 8, pp. 1619-1638, (2017)
[3]  
Zhang Xiao-Jian, Meng Xiao-Feng, Differential privacy in data publication and analysis, Chinese Journal of Computers, 37, 4, pp. 927-949, (2014)
[4]  
Dwork C, Mcsherry F, Nissim K, Smith A D., Calibrating noise to sensitivity in private data analysis, Proceedings of the 3rd Theory of Cryptography Conference(TCC), pp. 265-284, (2006)
[5]  
Dwork C, Roth A., The algorithmic foundations of differential privacy, Foundations and Trends in Theoretical Computer Science, 9, 3-4, pp. 211-407, (2014)
[6]  
Dwork C., Differential privacy: A survey of results, Proceedings of the 5th International Conference on Theory and Applications of Models of Computation(TAMC), pp. 1-19, (2008)
[7]  
Kalantari K, Sankar L, Sarwate A D., Robust privacy-utility tradeoffs under differential privacy and hamming distortion, IEEE Transactions on Information Forensics and Security, 13, 11, pp. 2816-2830, (2018)
[8]  
Alvim M S, Andres M E, Chatzikokolakis K, Degano P, Palamidessi C., Differential privacy: On the trade-off between utility and information leakage, Formal Aspects in Security and Trust, 7140, pp. 39-54, (2011)
[9]  
Shannon C E., A mathematical theory of communication, Bell System Technical Journal, 27, 3, pp. 379-423, (1948)
[10]  
Smith G., On the foundations of quantitative information flow, Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures(FoSSaCS), pp. 288-302, (2009)