Integro: Leveraging Victim Prediction for Robust Fake Account Detection in OSNs

被引:69
作者
Boshmaf, Yazan [1 ]
Logothetis, Dionysios [2 ]
Siganos, Georgos [4 ]
Leria, Jorge [3 ]
Lorenzo, Jose [3 ]
Ripeanu, Matei [1 ]
Beznosov, Konstantin [1 ]
机构
[1] Univ British Columbia, Vancouver, BC, Canada
[2] Tel Res, Barcelona, Spain
[3] Tuenti, Tel Digital, Madrid, Spain
[4] Qatar Comp Res Inst, Ar Rayyan, Qatar
来源
22ND ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2015) | 2015年
关键词
COMMUNITY STRUCTURE;
D O I
10.14722/ndss.2015.23260
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Detecting fake accounts in online social networks (OSNs) protects OSN operators and their users from various malicious activities. Most detection mechanisms attempt to predict and classify user accounts as real (i.e., benign, honest) or fake (i.e., malicious, Sybil) by analyzing user-level activities or graph-level structures. These mechanisms, however, are not robust against adversarial attacks in which fake accounts cloak their operation with patterns resembling real user behavior. We herein demonstrate that victims, benign users who control real accounts and have befriended fakes, form a distinct classification category that is useful for designing robust detection mechanisms. First, as attackers have no control over victim accounts and cannot alter their activities, a victim account classifier which relies on user-level activities is relatively harder to circumvent. Second, as fakes are directly connected to victims, a fake account detection mechanism that integrates victim prediction into graph-level structures is more robust against manipulations of the graph. To validate this new approach, we designed Integro, a scalable defense system that helps OSNs detect fake accounts using a meaningful a user ranking scheme. Integro starts by predicting victim accounts from user-level activities. After that, it integrates these predictions into the graph as weights, so that edges incident to predicted victims have much lower weights than others. Finally, Integro ranks user accounts based on a modified random walk that starts from a known real account. Integro guarantees that most real accounts rank higher than fakes so that OSN operators can take actions against low-ranking fake accounts. We implemented Integro using widely-used, open-source distributed computing platforms in which it scaled nearly linearly. We evaluated Integro against SybilRank, the state-of-the-art in fake account detection, using real-world datasets and a large-scale deployment at Tuenti, the largest OSN in Spain. We show that Integro significantly outperforms SybilRank in user ranking quality, where the only requirement is to employ a victim classifier is better than random. Moreover, the deployment of Integro at Tuenti resulted in up to an order of magnitude higher precision in fake accounts detection, as compared to SybilRank.
引用
收藏
页数:15
相关论文
共 63 条
[1]   SoK: The Evolution of Sybil Defense via Social Networks [J].
Alvisi, Lorenzo ;
Clement, Allen ;
Epasto, Alessandro ;
Lattanzi, Silvio ;
Panconesi, Alessandro .
2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, :382-396
[2]  
[Anonymous], 2004, P 30 INT C VERY LARG
[3]  
[Anonymous], P 5 INT WORKSH SEC T
[4]  
[Anonymous], 2012, P 7 ACM S INF COMM S
[5]  
[Anonymous], 2011, Proceedings of the International AAAI Conference on Web and Social Media
[6]  
[Anonymous], P 9 ANN NETW DISTR S
[7]  
[Anonymous], 2012, Communication Systems and Networks (COMSNETS), 2012 Fourth International Conference on
[8]  
Behrends E, 2000, VIEWEG, V228
[9]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[10]  
Boshmaf Y, 2012, P LEET 12, V12