Discretionary social network data revelation with a user-centric utility guarantee

The proliferation of online social networks has created intense interest in studying their nature and revealing information of interest to the end user. At the same time, such revelation raises privacy concerns. Existing research addresses this problem following an approach popular in the database community: a model of data privacy is defined, and the data is rendered in a form that satisfies the constraints of that model while aiming to maximize some utility measure. Still, these is no consensus on a clear and quantifiable utility measure over graph data. In this paper, we take a different approach: we define a utility guarantee, in terms of certain graph properties being preserved, that should be respected when releasing data, while otherwise distorting the graph to an extend desired for the sake of confidentiality. We propose a form of data release which builds on current practice in social network platforms: A user may want to see a subgraph of the network graph, in which that user as well as connections and affiliates participate. Such a snapshot should not allow malicious users to gain private information, yet provide useful information for benevolent users. We propose a mechanism to prepare data for user view under this setting. In an experimental study with real data, we demonstrate that our method preserves several properties of interest more successfully than methods that randomly distort the graph to an equal extent, while withstanding structural attacks proposed in the literature.

[1]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

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

[3]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

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

[5]  Mark S. Granovetter T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[6]  Daniel Z. Levin,et al.  The Strength of Weak Ties You Can Trust: The Mediating Role of Trust in Effective Knowledge Transfer , 2004, Manag. Sci..

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

[8]  W. Galston Trust: The Social Virtues and the Creation of Prosperity , 1996 .

[9]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

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

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

[12]  Chedy Raïssi,et al.  Delineating social network data anonymization via random edge perturbation , 2012, CIKM.

[13]  Duncan J. Watts,et al.  Social search in "Small-World" experiments , 2009, WWW '09.

[14]  Rajeev Motwani,et al.  Link Privacy in Social Networks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

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

[16]  Panos Kalnis,et al.  Fast Data Anonymization with Low Information Loss , 2007, VLDB.

[17]  Weining Zhang,et al.  Edge Anonymity in Social Network Graphs , 2009, 2009 International Conference on Computational Science and Engineering.

[18]  Krishna P. Gummadi,et al.  Growth of the flickr social network , 2008, WOSN '08.

[19]  Chedy Raïssi,et al.  Anonymizing set-valued data by nonreciprocal recoding , 2012, KDD.

[20]  Siddharth Srivastava,et al.  Anonymizing Social Networks , 2007 .

[21]  Christos Faloutsos,et al.  ANF: a fast and scalable tool for data mining in massive graphs , 2002, KDD.

[22]  Danah Boyd,et al.  Social Network Sites: Definition, History, and Scholarship , 2007, J. Comput. Mediat. Commun..

[23]  Cliff Lampe,et al.  The Benefits of Facebook "Friends: " Social Capital and College Students' Use of Online Social Network Sites , 2007, J. Comput. Mediat. Commun..

[24]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[25]  Chedy Raïssi,et al.  Utility-driven anonymization in data publishing , 2011, CIKM '11.

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

[27]  Bettina Berendt,et al.  The Social Web and Privacy: Practice, Reciprocity and Conflicts in Social Networks , 2010 .

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

[29]  Jure Leskovec,et al.  Planetary-scale views on a large instant-messaging network , 2008, WWW.

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

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

[32]  Stéphane Bressan,et al.  Sensitive Label Privacy Protection on Social Network Data , 2012, SSDBM.

[33]  Martin Suter,et al.  Small World , 2002 .

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