(k, d)-core anonymity: structural anonymization of massive networks

Networks entail vulnerable and sensitive information that pose serious privacy threats. In this paper, we introduce, k-core attack, a new attack model which stems from the k-core decomposition principle. K-core attack undermines the privacy of some state-of-the-art techniques. We propose a novel structural anonymization technique called (k, Δ)-Core Anonymity, which harnesses the k-core attack and structurally anonymizes small and large networks. In addition, although real-world social networks are massive in nature, most existing works focus on the anonymization of networks with less than one hundred thousand nodes. (k, Δ)-Core Anonymity is tailored for massive networks. To the best of our knowledge, this is the first technique that provides empirical studies on structural network anonymization for massive networks. Using three real and two synthetic datasets, we demonstrate the effectiveness of our technique on small and large networks with up to 1.7 million nodes and 17.8 million edges. Our experiments reveal that our approach outperforms a state-of-the-art work in several aspects.

[1]  Philip S. Yu,et al.  Personalized Privacy Protection in Social Networks , 2010, Proc. VLDB Endow..

[2]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

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

[4]  Xiaowei Ying,et al.  Randomizing Social Networks: a Spectrum Preserving Approach , 2008, SDM.

[5]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

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

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

[8]  Cynthia Dwork,et al.  Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography , 2007, WWW '07.

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

[10]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[11]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[12]  Chedy Raïssi,et al.  Delineating social network data anonymization via random edge perturbation , 2012, CIKM.

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

[14]  Alessandro Vespignani,et al.  K-core Decomposition: a Tool for the Visualization of Large Scale Networks , 2005, ArXiv.

[15]  Philip S. Yu,et al.  Structural Diversity for Privacy in Publishing Social Networks , 2011, SDM.

[16]  Sean Chester,et al.  k-Anonymization of Social Networks by Vertex Addition , 2011, ADBIS.

[17]  Sofya Raskhodnikova,et al.  Private analysis of graph structure , 2011, Proc. VLDB Endow..

[18]  Leting Wu,et al.  Reconstruction from Randomized Graph via Low Rank Approximation , 2010, SDM.

[19]  James Cheng,et al.  Efficient core decomposition in massive networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[20]  Ben Y. Zhao,et al.  Sharing graphs using differentially private graph models , 2011, IMC '11.

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

[22]  Qing Zhang,et al.  Anonymizing bipartite graph data using safe groupings , 2008, The VLDB Journal.

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