k-Degree anonymity on directed networks

In this paper, we consider the problem of anonymization on directed networks. Although there are several anonymization methods for networks, most of them have explicitly been designed to work with undirected networks and they cannot be straightforwardly applied when they are directed. Moreover, ignoring the direction of the edges causes important information loss on the anonymized networks in the best case. In the worst case, the direction of the edges may be used for reidentification, if it is not considered in the anonymization process. Here, we propose two different models for k-degree anonymity on directed networks, and we also present algorithms to fulfill these k-degree anonymity models. Given a network G, we construct a k-degree anonymous network by the minimum number of edge additions. Our algorithms use multivariate micro-aggregation to anonymize the degree sequence, and then, they modify the graph structure to meet the k-degree anonymous sequence. We apply our algorithms to several real datasets and demonstrate their efficiency and practical utility.

[1]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

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

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

[4]  Jordi Herrera-Joancomartí,et al.  k-Degree anonymity and edge selection: improving data utility in large networks , 2017, Knowledge and Information Systems.

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

[6]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[7]  Kenneth L. Clarkson,et al.  Toward Identity Anonymization in Social Networks , 2010, Link Mining.

[8]  Xuesong Lu,et al.  Fast Identity Anonymization on Graphs , 2012, DEXA.

[9]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[10]  Mirco Musolesi,et al.  On the k-Anonymization of Time-Varying and Multi-Layer Social Graphs , 2015, ICWSM.

[11]  Jordi Casas-Roma,et al.  An Evaluation of Edge Modification Techniques for Privacy-Preserving on Graphs , 2015, MDAI.

[12]  Vicenç Torra,et al.  Anonymizing graphs: measuring quality for clustering , 2014, Knowledge and Information Systems.

[13]  Rolf Niedermeier,et al.  A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems , 2016, ArXiv.

[14]  Fernando Ferri,et al.  New forms of social and professional digital relationships: the case of Facebook , 2011, Social Network Analysis and Mining.

[15]  Huiru Zheng,et al.  Evaluation repeated random walks in community detection of social networks , 2010, 2010 International Conference on Machine Learning and Cybernetics.

[16]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[17]  Rolf Niedermeier,et al.  A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs , 2018, Algorithmica.

[18]  Gemma C. Garriga,et al.  Randomization Techniques for Graphs , 2009, SDM.

[19]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[20]  Vicenç Torra,et al.  An algorithm for k-degree anonymity on large networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[21]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[22]  Sumitra Mukherjee,et al.  A Polynomial Algorithm for Optimal Univariate Microaggregation , 2003, IEEE Trans. Knowl. Data Eng..

[23]  David Lo,et al.  Mining indirect antagonistic communities from social interactions , 2012, Knowledge and Information Systems.

[24]  Rolf Niedermeier,et al.  A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs , 2016, IPEC.

[25]  Rolf Niedermeier,et al.  A refined complexity analysis of degree anonymization in graphs , 2013, Inf. Comput..

[26]  Tore Opsahl,et al.  Clustering in weighted networks , 2009, Soc. Networks.

[27]  Alex Thomo,et al.  Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes , 2012, Social Network Analysis and Mining.

[28]  Josep Domingo-Ferrer,et al.  Practical Data-Oriented Microaggregation for Statistical Disclosure Control , 2002, IEEE Trans. Knowl. Data Eng..

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

[30]  Julián Salas,et al.  Faster Univariate Microaggregation for Power Law Distributions: k-Degree-Anonymity for Big Graphs , 2016, 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW).

[31]  L. Takac.  DATA ANALYSIS IN PUBLIC SOCIAL NETWORKS , 2012 .

[32]  Josep Domingo-Ferrer,et al.  Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation , 2005, Data Mining and Knowledge Discovery.

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

[34]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

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

[36]  Michael Ley,et al.  The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives , 2002, SPIRE.

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

[38]  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.

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

[40]  Balachander Krishnamurthy,et al.  Class-based graph anonymization for social network data , 2009, Proc. VLDB Endow..

[41]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[42]  Vicenç Torra,et al.  Improving the characterization of P-stability for applications in network privacy , 2016, Discret. Appl. Math..

[43]  Sepp Hartung,et al.  Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks , 2014, SEA.

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