Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs

In recent years, concerns of privacy have become more prominent for social networks. Anonymizing a graph meaningfully is a challenging problem, as the original graph properties must be preserved as well as possible. We introduce a generalization of the degree anonymization problem posed by Liu and Terzi. In this problem, our goal is to anonymize a given subset of nodes while adding the fewest possible number of edges. The main contribution of this paper is an efficient algorithm for this problem by exploring its connection with the degree-constrained subgraph problem. Our experimental results show that our algorithm performs very well on many instances of social network data.

[1]  Sean Chester,et al.  Social Network Privacy for Attribute Disclosure Attacks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[2]  Sean Chester,et al.  Complexity of social network anonymization , 2012, Social Network Analysis and Mining.

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

[4]  Xiaowei Ying,et al.  Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing , 2009, SNA-KDD '09.

[5]  Latanya Sweeney,et al.  Achieving k-Anonymity Privacy Protection Using Generalization and Suppression , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

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

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

[8]  Jon M. Kleinberg,et al.  Wherefore art thou R3579X? , 2011, Commun. ACM.

[9]  Lise Getoor,et al.  Preserving the Privacy of Sensitive Relationships in Graph Data , 2007, PinKDD.

[10]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[11]  Ting Yu,et al.  Anonymizing bipartite graph data using safe groupings , 2008, Proc. VLDB Endow..

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

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

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

[15]  Jian Pei,et al.  The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks , 2011, Knowledge and Information Systems.

[16]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.