GraphProtector: A Visual Interface for Employing and Assessing Multiple Privacy Preserving Graph Algorithms

Analyzing social networks reveals the relationships between individuals and groups in the data. However, such analysis can also lead to privacy exposure (whether intentionally or inadvertently): leaking the real-world identity of ostensibly anonymous individuals. Most sanitization strategies modify the graph's structure based on hypothesized tactics that an adversary would employ. While combining multiple anonymization schemes provides a more comprehensive privacy protection, deciding the appropriate set of techniques—along with evaluating how applying the strategies will affect the utility of the anonymized results-remains a significant challenge. To address this problem, we introduce GraphProtector, a visual interface that guides a user through a privacy preservation pipeline. GraphProtector enables multiple privacy protection schemes which can be simultaneously combined together as a hybrid approach. To demonstrate the effectiveness of GraphPro tector, we report several case studies and feedback collected from interviews with expert users in various scenarios.

[1]  Neil J. Hurley,et al.  Visualization of trends in subscriber attributes of communities on mobile telecommunications networks , 2014, Social Network Analysis and Mining.

[2]  Fangzhao Wu,et al.  OpinionFlow: Visual Analysis of Opinion Diffusion on Social Media , 2014, IEEE Transactions on Visualization and Computer Graphics.

[3]  Minas Gjoka,et al.  Construction of simple graphs with a target joint degree matrix and beyond , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[4]  Robert Kosara,et al.  Adaptive Privacy-Preserving Visualization Using Parallel Coordinates , 2011, IEEE Transactions on Visualization and Computer Graphics.

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

[6]  Qian Xiao,et al.  Differentially private network data release via structural inference , 2014, KDD.

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

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

[9]  Helwig Hauser,et al.  Curve Density Estimates , 2011, Comput. Graph. Forum.

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

[11]  Arjan Kuijper,et al.  Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges , 2011, Eurographics.

[12]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[13]  Jan Westerholm,et al.  Methods for deriving and calibrating privacy-preserving heat maps from mobile sports tracking application data , 2015 .

[14]  Yang Wang,et al.  Privacy preserving event sequence data visualization using a Sankey diagram-like representation , 2016, SIGGRAPH Asia Symposium on Visualization.

[15]  Daniel A. Keim,et al.  Visual Analytics: Definition, Process, and Challenges , 2008, Information Visualization.

[16]  Danai Koutra,et al.  RolX: structural role extraction & mining in large graphs , 2012, KDD.

[17]  Silvio Lattanzi,et al.  An efficient reconciliation algorithm for social networks , 2013, Proc. VLDB Endow..

[18]  Yingcai Wu,et al.  A Survey of Visual Analytics Techniques and Applications: State-of-the-Art Research and Future Challenges , 2013, Journal of Computer Science and Technology.

[19]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[20]  Michael Boss,et al.  Network topology of the interbank market , 2003, cond-mat/0309582.

[21]  Kwan-Liu Ma,et al.  A Utility-Aware Visual Approach for Anonymizing Multi-Attribute Tabular Data , 2018, IEEE Transactions on Visualization and Computer Graphics.

[22]  Kwan-Liu Ma,et al.  Privacy preserving visualization for social network data with ontology information , 2017, 2017 IEEE Pacific Visualization Symposium (PacificVis).

[23]  Xintao Wu,et al.  Preserving Differential Privacy in Degree-Correlation based Graph Generation , 2013, Trans. Data Priv..

[24]  Shouling Ji,et al.  Structure Based Data De-Anonymization of Social Networks and Mobility Traces , 2014, ISC.

[25]  Dorothea Wagner,et al.  Approximating Clustering Coefficient and Transitivity , 2005, J. Graph Algorithms Appl..

[26]  Vitaly Shmatikov,et al.  De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.

[27]  Yong-Yeol Ahn,et al.  Community-Enhanced De-anonymization of Online Social Networks , 2014, CCS.

[28]  Mengchen Liu,et al.  A survey on information visualization: recent advances and challenges , 2014, The Visual Computer.

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

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

[31]  Paul Erdös,et al.  How to Define an Irregular Graph , 1988 .

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

[33]  Ravi Shankar Singh,et al.  Error-tolerant graph matching using homeomorphism , 2017, 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[34]  Jie Wu,et al.  Community-Aware Opportunistic Routing in Mobile Social Networks , 2014, IEEE Transactions on Computers.

[35]  Prateek Mittal,et al.  SecGraph: A Uniform and Open-source Evaluation System for Graph Data Anonymization and De-anonymization , 2015, USENIX Security Symposium.

[36]  Alessia Saggese,et al.  Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3 , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[37]  Manuel Graña,et al.  Semantically enhanced network analysis for influencer identification in online social networks , 2017, Neurocomputing.

[38]  Walter Didimo,et al.  An advanced network visualization system for financial crime detection , 2011, 2011 IEEE Pacific Visualization Symposium.

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

[40]  Lei Chen,et al.  A Survey of Privacy-Preservation of Graphs and Social Networks , 2010, Managing and Mining Graph Data.

[41]  K. Möller,et al.  Business Relationships and Networks: Managerial Challenge of Network Era , 1999 .

[42]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[43]  Shlomo Havlin,et al.  The structural role of weak and strong links in a financial market network , 2008, 0805.2477.

[44]  Stanford,et al.  Learning to Discover Social Circles in Ego Networks , 2012 .

[45]  Qiuju Luo,et al.  Using social network analysis to explain communication characteristics of travel-related electronic word-of-mouth on social networking sites. , 2015 .

[46]  Vassilios S. Verykios,et al.  Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[47]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

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

[49]  R. Burt.  Structural Holes and Good Ideas1 , 2004, American Journal of Sociology.

[50]  謝楠楨.  An integrated data mining and behavioral scoring model for analyzing bank customers , 2004 .

[51]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

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

[53]  D. W. Scott,et al.  Multivariate Density Estimation, Theory, Practice and Visualization , 1992 .

[54]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.