A Framework for Enabling Privacy Preserving Analysis of Graph Properties in Distributed Graphs

In the real world, many phenomena can be naturally modeled as a graph whose nodes represent entities and whose edges represent interactions or relationships between the entities. Past and ongoing research on graphs has developed concepts and theories that may deepen the understanding of the graph data and facilitate solving many problems of practical interest represented by graphs. However, little of this work takes privacy concerns into account. This paper contributes to privacy preserving graph analysis research by proposing a framework for enabling privacy preserving analysis of graph properties in distributed graphs. The framework is composed of three modules. We discuss the functionality of each module and describe how the modules together ensure the privacy protection while retaining graph properties and answer users’ queries pertaining to graph properties.

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

[2]  Daniel Jackoway.  Wherefore Art Thou R 3579 X ? Anonymized Social Networks , Hidden Patterns , and Structural , 2014 .

[3]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

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

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

[6]  Ivan Damgård,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.

[7]  Jeffrey Xu Yu,et al.  Neighborhood-privacy protected shortest distance computing in cloud , 2011, SIGMOD '11.

[8]  Bhavani M. Thuraisingham,et al.  Inferring private information using social network data , 2009, WWW '09.

[9]  Rajeev Motwani,et al.  Link Privacy in Social Networks , 2008, ICDE.

[10]  Vijayalakshmi Atluri,et al.  Preserving Privacy in Social Networks: A Structure-Aware Approach , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[11]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

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

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

[14]  Jon M. Kleinberg,et al.  Challenges in mining social network data: processes, privacy, and paradoxes , 2007, KDD '07.

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

[16]  Balachander Krishnamurthy,et al.  Privacy in dynamic social networks , 2010, WWW '10.

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

[18]  Pierangela Samarati,et al.  Generalizing Data to Provide Anonymity when Disclosing Information , 1998, PODS 1998.

[19]  Basit Shafiq,et al.  Privacy-preserving link discovery , 2008, SAC '08.

[20]  David D. Jensen,et al.  Accurate Estimation of the Degree Distribution of Private Networks , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[21]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[22]  R. Cramer,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000 .

[23]  Alessandro Acquisti,et al.  Information revelation and privacy in online social networks , 2005, WPES '05.

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

[25]  G. Chartrand.  Introductory Graph Theory , 1984 .

[26]  S. Rajsbaum.  Foundations of Cryptography , 2014 .

[27]  Lise Getoor,et al.  To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles , 2009, WWW '09.

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

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

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