Abstract

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 graphlevel 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 largescale 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.

Highlights

  • The rapid growth of online social networks (OSNs), such as Facebook, Twitter, RenRen, LinkedIn, Google+, and Tuenti, has been followed by an increased interest in abusing them

  • We prove that if an OSN operator uses a victim classifier that is uniformly random, which means each user account vi ∈ V is vulnerable with p(vi) = 0.5, Íntegro is as good as SybilRank in terms of ranking quality [13]: Corollary 4.2: For a uniformly random victims classifier, the number of fake accounts that rank similar to or higher than real accounts after O(log n) iterations is O(|Ea| log n)

  • As SybilRank limits the number of fakes that can outrank real accounts by the number of attack edges, its area under ROC curve (AUC) degraded significantly as more attack edges were added to each graph

Read more

Summary

Introduction

The rapid growth of online social networks (OSNs), such as Facebook, Twitter, RenRen, LinkedIn, Google+, and Tuenti, has been followed by an increased interest in abusing them. Due to their open nature, OSNs are vulnerable to the Sybil attack [1], where an attacker creates multiple fake accounts called Sybils for various adversarial objectives. In its 2014 earnings report, Facebook estimated that up to 15 millions (%1.2) of its monthly active users are “undesirable,” representing fake accounts that are used in violation of the site’s terms of service [2]. We do not consider attackers who are capable of hijacking real accounts, as there are existing detection systems that tackle this threat (e.g., COMPA [25]). We focus on detecting fake accounts that can befriend a large number of benign users in order to mount subsequent attacks, as we describe

Objectives
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call