On Your Social Network De-anonymizablity: Quantification and Large Scale Evaluation with Seed Knowledge

被引:44
作者
Ji, Shouling [1 ]
Li, Weiqing [1 ]
Gong, Neil Zhenqiang [2 ]
Mittal, Prateek [3 ]
Beyah, Raheem [1 ]
机构
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
[2] Univ Calif Berkeley, Berkeley, CA 94720 USA
[3] Princeton Univ, Princeton, NJ 08544 USA
来源
22ND ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2015) | 2015年
基金
美国国家科学基金会;
关键词
D O I
10.14722/ndss.2015.23096
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we conduct the first comprehensive quantification on the perfect de-anonymizability and partial deanonymizability of real world social networks with seed information in general scenarios, where a social network can follow an arbitrary distribution model. This quantification provides the theoretical foundation for existing structure based de-anonymization attacks (e.g., [1][2][3]) and closes the gap between de-anonymization practice and theory. Besides that, our quantification can serve as a testing-stone for the effectiveness of anonymization techniques, i.e., researchers can employ our quantified structural conditions to evaluate the potential deanonymizability of the anonymized social networks. Based on our quantification, we conduct a large scale evaluation on the de-anonymizability of 24 various real world social networks by quantitatively showing: 1) the conditions for perfect and (1 - epsilon) de-anonymization of a social network, where. specifies the tolerated de-anonymization error, and 2) the number of users of a social network that can be successfully de-anonymized. Furthermore, we show that, both theoretically and experimentally, the overall structural information based de-anonymization attack is much more powerful than the seed knowledge-only based de-anonymization attack, and even without any seed information, a social network can be perfectly or partially de-anonymized. Finally, we discuss the implications of this work. Our findings are expected to shed light on the future research in the structural data anonymization and de-anonymization area, and to help data owners evaluate their structural data vulnerability before data sharing and publishing.
引用
收藏
页数:15
相关论文
共 22 条
[1]  
Backstrom Lars, 2007, P INT C WORLD WID WE, DOI DOI 10.1145/1242572.1242598
[2]  
Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1
[3]  
Gong N. Z., 2012, P 2012 INT MEAS C, P131
[4]   Resisting Structural Re-identification in Anonymized Social Networks [J].
Hay, Michael ;
Miklau, Gerome ;
Jensen, David ;
Towsley, Don ;
Weis, Philipp .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (01) :102-114
[5]   Structural Data De-anonymization: Quantification, Practice, and Implications [J].
Ji, Shouling ;
Li, Weiqing ;
Srivatsa, Mudhakar ;
Beyah, Raheem .
CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, :1040-1053
[6]   An efficient reconciliation algorithm for social networks [J].
Korula, Nitish ;
Lattanzi, Silvio .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 7 (05) :377-388
[7]  
Li N., CCS 2013
[8]  
Liu K., SIGMOD 2008
[9]  
Meyerson A., PODS 2004
[10]   De-anonymizing Social Networks [J].
Narayanan, Arvind ;
Shmatikov, Vitaly .
PROCEEDINGS OF THE 2009 30TH IEEE SYMPOSIUM ON SECURITY AND PRIVACY, 2009, :173-187