On analyzing and evaluating privacy measures for social networks under active attack

Abstract Widespread usage of complex interconnected social networks such as Facebook, Twitter and LinkedIn in modern internet era has also unfortunately opened the door for privacy violation of users of such networks by malicious entities. In this article we investigate, both theoretically and empirically, privacy violation measures of large networks under active attacks that was recently introduced in Trujillo-Rasua and Yero (2016). Our theoretical result indicates that the network manager responsible for prevention of privacy violation must be very careful in designing the network if its topology does not contain a cycle . Our empirical results shed light on privacy violation properties of eight real social networks as well as a large number of synthetic networks generated by both the classical Erdos–Renyi model and the scale-free random networks generated by the Barabasi–Albert preferential-attachment model.

[1]  Ruby B. Lee,et al.  Privacy-preserving Machine Learning through Data Obfuscation , 2018, ArXiv.

[2]  Carsten Wiuf,et al.  Subnets of scale-free networks are not scale-free: sampling properties of networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Roberto Grossi,et al.  On computing the diameter of real-world undirected graphs , 2013, Theor. Comput. Sci..

[4]  Yong Gao,et al.  On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs , 2017, COCOON.

[5]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[6]  Prasanna Gai,et al.  Contagion in financial networks , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[7]  Angelika Sachs,et al.  Completeness, Interconnectedness and Distribution of Interbank Exposures: A Parameterized Analysis of the Stability of Financial Networks , 2011, SSRN Electronic Journal.

[8]  Mario Fritz,et al.  ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Models , 2018, NDSS.

[9]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[10]  Ismael González Yero,et al.  k-Metric Antidimension: a Privacy Measure for Social Graphs , 2014, Inf. Sci..

[11]  Egon Schaden.  Turrialba. Social systems and the introduction of change , 1955 .

[12]  Bhaskar DasGupta,et al.  Topological implications of negative curvature for biological and social networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Sjouke Mauw,et al.  Counteracting Active Attacks in Social Network Graphs , 2016, DBSec.

[14]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[15]  Edson Bastos e Santos,et al.  Network Structure and Systemic Risk in Banking Systems , 2010 .

[16]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[17]  Ismael González Yero,et al.  Characterizing 1-Metric Antidimensional Trees and Unicyclic Graphs , 2016, Comput. J..

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

[19]  Carlo Giupponi,et al.  Co-Authorship and Bibliographic Coupling Network Effects on Citations , 2014, PloS one.

[20]  Kathleen M. Carley,et al.  Patterns and dynamics of users' behavior and interaction: Network analysis of an online community , 2009, J. Assoc. Inf. Sci. Technol..

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

[22]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[23]  Zvi Galil,et al.  All Pairs Shortest Paths for Graphs with Small Integer Length Edges , 1997, J. Comput. Syst. Sci..

[24]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Raimund Seidel,et al.  On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs , 1995, J. Comput. Syst. Sci..

[26]  Andreas Wagner,et al.  Estimating coarse gene network structure from large-scale gene perturbation data. , 2002, Genome research.

[27]  Rama Cont,et al.  RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS , 2010, 1112.5687.

[28]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[29]  Michele Zito,et al.  Greedy Algorithms for Minimisation Problems in Random Regular Graphs , 2001, ESA.

[30]  Jure Leskovec,et al.  Motifs in Temporal Networks , 2016, WSDM.

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

[32]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[33]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[34]  S. Wasserman,et al.  Social Network Analysis: Computer Programs , 1994 .

[35]  David G. Schwartz,et al.  Why not scale free? Simulating company ego networks on Twitter , 2016, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[36]  Mathias Hauptmann,et al.  Approximation complexity of Metric Dimension problem , 2012, J. Discrete Algorithms.

[37]  Raphael Yuster,et al.  Computing the diameter polynomially faster than APSP , 2010, ArXiv.

[38]  John Scott.  What is social network analysis , 2010 .

[39]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[40]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Raya Khanin,et al.  How Scale-Free Are Biological Networks , 2006, J. Comput. Biol..

[42]  Azriel Rosenfeld,et al.  Landmarks in Graphs , 1996, Discret. Appl. Math..

[43]  S. Markose,et al.  Too Interconnected To Fail: Financial Contagion and Systemic Risk in Network Model of CDS and Other Credit Enhancement Obligations of US Banks , 2010 .

[44]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[45]  Marek Karpinski,et al.  Inapproximability of dominating set on power law graphs , 2012, Theor. Comput. Sci..

[46]  Zvi Galil,et al.  Data structures and algorithms for disjoint set union problems , 1991, CSUR.

[47]  Tanima Chatterjee,et al.  On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack , 2016, ArXiv.

[48]  Bhaskar DasGupta,et al.  On optimal approximability results for computing the strong metric dimension , 2014, Discret. Appl. Math..

[49]  Zvi Galil,et al.  All Pairs Shortest Distances for Graphs with Small Integer Length Edges , 1997, Inf. Comput..

[50]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.