基于节点特征的不确定图社交网络隐私保护方法

信息安全研究 ›› 2018, Vol. 4 ›› Issue (6): 533-538.

基于节点特征的不确定图社交网络隐私保护方法

颜军¹,²,胡静¹,²,温阁¹,²,田堉攀³

1. 陕西师范大学计算机科学学院
2. 陕西师范大学计算机科学学院
3. 陕西师范大学计算机学院

收稿日期:2018-06-14 出版日期:2018-06-15 发布日期:2018-06-14
通讯作者: 颜军
作者简介: 颜军博士生,讲师,主要研究领域为网络安全、隐私保护胡静硕士生,主要研究领域为网络安全、隐私保护温阁硕士生,主要研究领域为数据挖掘、隐私保护田堉攀硕士生,主要研究领域为隐私保护

A Method of Uncertain Graphs Based on Node Characteristics for Preserving Privacy in Social Networks

Received:2018-06-14 Online:2018-06-15 Published:2018-06-14

摘要/Abstract

摘要： 随着互联网技术的广泛应用,基于社交网络的网络服务逐渐成为人们生活的一部分.为了解决社交网络的隐私数据泄露产生的网络安全问题,提出了基于节点特征的不确定图隐私保护方法.与常用的不确定图方法不同，该方法从分析节点的特征入手，利用节点的度中心性选择出重要节点,之后在它们的邻接节点之间添加边, 对选择出的三角形注入不确定性，最后生成不确定图实现隐私保护.实验证实, 这种方法不仅能实现社交网络的隐私保护,而且与(k,ε)混淆算法相比较数据效用更好.

关键词: 社交网络, 隐私保护, 不确定图, 度中心性, 边熵

Abstract: tWith the wide application of the Internet, network services based on social network has gradually become a part of peoples life. In order to solve the problem of network security which caused by disclosure of privacy data in social networks, this paper proposes a method of uncertain graph based on node characteristics. Unlike the commonly used method of uncertain graph, starting with analysing the characteristics of the nodes, this method selects the important nodes by using the degree centrality of the nodes, adds some edges between their adjacent nodes, injects uncertainty into the selected triangles, and generates an uncertain graph to realize privacy preserving in social network. The experiments conduct also show that this method can not only preserve the privacy of social networks, but also have better data effectiveness compared with the (k,ε) obfuscation algorithm.

Key words: social network, preserving privacy, uncertainty graph, degree centrality, edge entropy

颜军胡静温阁田堉攀. 基于节点特征的不确定图社交网络隐私保护方法[J]. 信息安全研究, 2018, 4(6): 533-538.

参考文献

[1] 第41次《中国互联网络发展状况统计报告》发布[EB/OL].[2018-03-20].http://www.cnnic.net.cn/gywm/xwzx/rdxw/201801/t20180131_70188.htm [2] eMarketer：2017年全球社交网络用户达24.8亿[EB/OL]. [2018-03-20].http://www.199it.com/archives/678247.html [3] 2016年十大数据泄露事件：社交网络成泄露重灾区[EB/OL]. [2018-03-20].http://www.raincent.com/content-10-8087-2.html [4] 刘向宇, 王斌, 杨晓春. 社会网络数据发布隐私保护技术综述[J]. 软件学报, 2014,25(3): 576-590 [5] Casas-Roma J, Herrera-Joancomartí J, Torra V. A survey of graph modification techniques for privacy-preserving on networks[J]. Artificial Intelligence Review, 2017, 47(3): 341-366 [6] Ying X, Wu X. Randomizing social networks: a spectrum preserving approach[C]//Proc of the Data Mining, Society for Industrial and Applied Mathematics, Atlanta, 2008: 739-750 [7] Ying X, Pan K, Wu X, et al. Comparisons of rando-mization and k-degree anonymization schemes for privacy preserving social network publishing[C]//Proc of the 3rd Workshop on Social Network Mining andAnalysis, New York ,ACM, 2009: 10 [8] Zou L, Chen L, Özsu M T. K-automorphism: A general framework for privacy preserving network publication[J]. Proceedings of the VLDB Endowment, 2009, 2(1): 946-957 [9] Casas-Roma J, Herrera-Joancomartí J, Torra V. k-Degree anonymity and edge selection: improving data utility in large networks [J]. Knowledge and Information Systems, 2017, 50(2): 447-474 [10] Campan, Alina, and Traian Marius Truta. Data and structural k-anonymity in social networks[C]//Proc of Privacy, Security, and Trust in KDD, Berlin , Springer, 2009: 33-54 [11] Boldi P, Bonchi F, Gionis A, et al. Injecting uncertainty in graphs for identity obfuscation[C]//Proc of the VLDB Endowment, 2012, 5(11):1376-1387 [12] P. Mittal, C. Papamanthou, D. Song. Preserving Link Privacy in Social Network Based Systems[C]//20th Annual Network and Distributed System Security Symp, USA. 2013. [13] Nguyen H H, Imine A, Rusinowitch M. A maximum variance approach for graph anonymization[C]//Int Symp on Foundations and Practice of Security, Cham, Springer, 2014: 49-64 [14] Nguyen H H, Imine A, Rusinowitch M. Anonymizing social graphs via uncertainty semantics[C]//10th ACM Symp on Information, Computer and Communications Security, ACM, 2015: 495-506 [15] Zhang, Xiaohang, et al. Identifying influential nodes in complex networks with community structure[J]. Knowledge-Based Systems, 2013, 42: 74-84