Graph Degree Histogram Publication Method with Node-Differential Privacy

被引：0
|
作者：
Zhang Y. [1 ]
Wei J. [1 ]
Li J. [1 ]
Liu W. [2 ]
Hu X. [1 ]
机构：
[1] State Key Laboratory of Mathematical Engineering and Advanced Computing, PLA Strategic Support Force Information Engineering University, Zhengzhou
[2] Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin, 541004, Guangxi
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2019年 / 56卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Degree distribution; Differential privacy; Graph data; Histogram publishing; Privacy protection;
D O I：
10.7544/issn1000-1239.2019.20170886
中图分类号：
学科分类号：
摘要：
The widespread use of various information systems, e.g. social networks, mail systems and recommendation systems, has produced a large amount of graph data. Publishing and sharing these data under the edge or node differential privacy can fully utilize their potential value, meanwhile, the privacy of the involved users can be preserved. Compared with the edge differential privacy, the node differential privacy can effectively prevent users from being re-identified. However, it will lead to a higher sensitivity of the query function at the same time. To conquer this problem, a novel method named sequence edge-removal (SER) is proposed, based on which two graph degree distribution histogram publication mechanisms under node difference privacy are put forward. The experiment results illustrate that the SER method can effectively suppress the sensitivity of the publishing mechanism, and also can retain more edges of the original graph. In addition, it decreases the errors between the published data and the original data. Compared with available works, under the constraint of providing the same level of privacy preservation, the proposed histogram publishing mechanism based on the SER method can describe the degree distribution of the original data more accurately, and thus improves the usability of the published data. © 2019, Science Press. All right reserved.
引用
收藏
页码：508 / 520
页数：12
相关论文
共 30 条
  • [1] Dwork C., Differential privacy, Proc of the 33rd Int Colloquium on Automata, Languages and Programming, pp. 1-12, (2006)
  • [2] Backstrom L., Dwork C., Kleinberg J., Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography, Proc of the 16th Int Conf on World Wide Web, pp. 181-190, (2007)
  • [3] Hay M., Li C., Miklau G., Et al., Accurate estimation of the degree distribution of private networks, Proc of the 11th IEEE Int Conf on Data Mining, pp. 169-178, (2009)
  • [4] Kasiviswanathan S.P., Nissim K., Raskhodnikova S., Et al., Analyzing graphs with node differential privacy, Proc of the 10th Conf on Theory of Cryptography, pp. 457-476, (2013)
  • [5] Blocki J., Blum A., Datta A., Et al., Differentially private data analysis of social networks via restricted sensitivity, Proc of the 4th Conf on Innovations in Theoretical Computer Science, pp. 87-96, (2013)
  • [6] Raskhodnikova S., Smith A., Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism, Proc of the 57th IEEE Annual Symp on Foundations of Computer Science, pp. 495-504, (2016)
  • [7] Day W.-Y., Li N., Lyu M., Publishing graph degree distribution with node differential privacy, Proc of the 16th Int Conf on Management of Data, pp. 123-138, (2016)
  • [8] Samarati P., Protecting respondents identities in microdata release, IEEE Transactions on Knowledge and Data Engineering, 13, 6, pp. 1010-1027, (2001)
  • [9] Machanavajjhala A., Gehrke J., Kifer D., Et al., l-diversity: Privacy beyond k-anonymity, ACM Transactions on Knowledge Discovery from Data, 1, 1, pp. 1-52, (2007)
  • [10] Dwork C., Naor M., Pitassi T., Et al., Differential privacy under continual observation, Proc of the 42nd ACM Symp on Theory of Computing, pp. 715-724, (2010)
123