Hybrid de-anonymization across real-world heterogeneous social networks

To enjoy various utility and services, people are active in multiple social networks nowadays. With tons of data generated on platforms, multiple accounts of the same user in different social networks can be used to de-anonymize the user in a large scale. The aggregation of user profiles poses a threat to user privacy. With a concern of privacy leakage, de-anonymization techniques, including graph based approaches and profile based approaches, are widely studied in recent years. However, few works throw light on the deanonymization between real-world heterogeneous social networks. In this paper, we propose a Hybrid De-anonymization Scheme (HDS) aiming at de-anonymizing heterogeneous social networks. HDS firstly leverages the network graph structure to significantly reduce the size of candidate set, then exploits user profile information to identify the correct mapping users with a high confidence. Performance evaluation on real-world social network datasets shows that HDS has considerable accuracy on de-anonymization and significantly outperforms the prior schemes.

[1]  Xiang-Yang Li,et al.  De-anonymizing social networks and inferring private attributes using knowledge graphs , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[2]  Reza Zafarani,et al.  Connecting Corresponding Identities across Communities , 2009, ICWSM.

[3]  Ming Li,et al.  FindU: Privacy-preserving personal profile matching in mobile social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  David J. Crandall,et al.  De-Anonymizing Users Across Heterogeneous Social Computing Platforms , 2013, ICWSM.

[5]  Haojin Zhu,et al.  De-anonymizing social networks: Using user interest as a side-channel , 2015, 2015 IEEE/CIC International Conference on Communications in China (ICCC).

[6]  Claude Castelluccia,et al.  How Unique and Traceable Are Usernames? , 2011, PETS.

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

[8]  Guanhua Yan,et al.  Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networking , 2013, IEEE Journal on Selected Areas in Communications.

[9]  Shuai Li,et al.  Demographics inference through Wi-Fi network traffic analysis , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[10]  Xinwen Fu,et al.  Classification of commercial and personal profiles on MySpace , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[11]  Philip S. Yu,et al.  COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency , 2015, KDD.

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

[13]  Prateek Mittal,et al.  On Your Social Network De-anonymizablity: Quantification and Large Scale Evaluation with Seed Knowledge , 2015, NDSS.

[14]  Peter Fankhauser,et al.  Identifying Users Across Social Tagging Systems , 2011, ICWSM.

[15]  Matthias Grossglauser,et al.  On the performance of percolation graph matching , 2013, COSN '13.

[16]  Ming Li,et al.  Privacy-Preserving Distributed Profile Matching in Proximity-Based Mobile Social Networks , 2013, IEEE Transactions on Wireless Communications.

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

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

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

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

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

[22]  Wenke Lee,et al.  The Price of Free: Privacy Leakage in Personalized Mobile In-Apps Ads , 2016, NDSS.

[23]  Reza Zafarani,et al.  Connecting users across social media sites: a behavioral-modeling approach , 2013, KDD.

[24]  Sree Hari Krishnan Parthasarathi,et al.  Exploiting innocuous activity for correlating users across sites , 2013, WWW.

[25]  Charles Elkan,et al.  The Field Matching Problem: Algorithms and Applications , 1996, KDD.

[26]  Guanhua Yan,et al.  Fine-grained private matching for proximity-based mobile social networking , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Xiaohui Liang,et al.  Privacy Leakage of Location Sharing in Mobile Social Networks: Attacks and Defense , 2016, IEEE Transactions on Dependable and Secure Computing.

[28]  G. N. Gilbert Computational Social Science , 2010 .

[29]  Michael Hicks,et al.  Deanonymizing mobility traces: using social network as a side-channel , 2012, CCS.

[30]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[31]  Barbara Fister The Price of “Free” , 2015 .

[32]  Matthias Grossglauser,et al.  A Bayesian method for matching two similar graphs without seeds , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[33]  William W. Cohen,et al.  A Comparison of String Metrics for Matching Names and Records , 2003 .