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

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

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

With 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（κ,ε） obfuscation algorithm.