Collective Influence Based Privacy Preservation for Social Networks

Privacy protection of sensitive information in social networks has become an urgent problem to be solved. The existing social network privacy protection schemes can guarantee data security to a certain extent, but will cause noise redundancy, which means data security and availability cannot be well balanced. In order to effectively reduce noise redundancy and take data security and availability into account, a privacy protection algorithm based on collective influence(CI) is proposed. CI is used as the noise sources on edge weight perturbation after randomization and normalization. Then the node perturbation strategy is added based on edge weight perturbation strategy: CI is used as the discriminant index to identify redundant vertices in the network, then some redundant vertices are removed. The perturbation strategy proposed can retain better data availability and greatly improve data security when achieving the privacy protection for both vertices and edge weights compared with the existing strategy.

[1]  Sean Chester,et al.  Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[2]  Laks V. S. Lakshmanan,et al.  Proceedings of the 2008 ACM SIGMOD international conference on Management of data , 2008, SIGMOD 2008.

[3]  Yong Zeng,et al.  Cooperative Jamming Strategy Based on Community Detection for Two-Hop Communication Networks , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[4]  Jie Wang,et al.  Privacy Preservation in Social Networks with Sensitive Edge Weights , 2009, SDM.

[5]  K. Liu,et al.  Towards identity anonymization on graphs , 2008, SIGMOD Conference.

[6]  Philip S. Yu,et al.  Privacy-preserving social network publication against friendship attacks , 2011, KDD.

[7]  Xiaohong Jiang,et al.  Eavesdropper-Tolerance Capability in Two-Hop Wireless Networks via Cooperative Jamming , 2015, Ad Hoc Sens. Wirel. Networks.

[8]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[9]  Tarik Taleb,et al.  Generalized Cooperative Multicast in Mobile Ad Hoc Networks , 2018, IEEE Transactions on Vehicular Technology.

[10]  Jia Liu,et al.  K-isomorphism: privacy preserving network publication against structural attacks , 2010, SIGMOD Conference.

[11]  Vicenç Torra,et al.  Evolutionary Algorithm for Graph Anonymization , 2013, ArXiv.

[12]  Robert H. Deng,et al.  Privacy leakage analysis in online social networks , 2015, Comput. Secur..

[13]  Siddharth Srivastava,et al.  Anonymizing Social Networks , 2007 .

[14]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2008, The VLDB Journal.

[15]  V. Varadharajan,et al.  Proceedings of the 4th International Symposium on Information, Computer, and Communications Security , 2009 .

[16]  Lin Zhang,et al.  An Uncertain Graph Approach for Preserving Privacy in Social Networks Based on Important Nodes , 2018, 2018 International Conference on Networking and Network Applications (NaNA).

[17]  Yanghua Xiao,et al.  k-symmetry model for identity anonymization in social networks , 2010, EDBT '10.

[18]  Jian Pei,et al.  Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[19]  Zhaobin Liu,et al.  Privacy Preservation in Social Network against Public Neighborhood Attacks , 2016, 2016 IEEE Trustcom/BigDataSE/ISPA.

[20]  Michaël Rusinowitch,et al.  Anonymizing Social Graphs via Uncertainty Semantics , 2015, AsiaCCS.

[21]  Ömer Egecioglu,et al.  Anonymizing weighted social network graphs , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[22]  Tamir Tassa,et al.  Injecting Uncertainty in Graphs for Identity Obfuscation , 2012, Proc. VLDB Endow..

[23]  Yulong Shen,et al.  Transmission protocol for secure big data in two-hop wireless networks with cooperative jamming , 2014, Inf. Sci..

[24]  Josep Domingo-Ferrer,et al.  A k-anonymous approach to privacy preserving collaborative filtering , 2015, J. Comput. Syst. Sci..

[25]  Danfeng Yao,et al.  The union-split algorithm and cluster-based anonymization of social networks , 2009, ASIACCS '09.

[26]  Fahong Yu,et al.  Privacy preservation based on clustering perturbation algorithm for social network , 2018, Multimedia Tools and Applications.

[27]  Xiaohong Jiang,et al.  Friendship-based cooperative jamming for secure communication in Poisson networks , 2016, Wirel. Networks.

[28]  Lei Zou,et al.  K-Automorphism: A General Framework For Privacy Preserving Network Publication , 2009, Proc. VLDB Endow..