Smoke Screener or Straight Shooter: Detecting Elite Sybil Attacks in User-Review Social Networks
Not on the map. Why?
Abstract (arXiv)
Popular User-Review Social Networks (URSNs)---such as Dianping, Yelp, and Amazon---are often the targets of reputation attacks in which fake reviews are posted in order to boost or diminish the ratings of listed products and services. These attacks often emanate from a collection of accounts, called Sybils, which are collectively managed by a group of real users. A new advanced scheme, which we term elite Sybil attacks, recruits organically highly-rated accounts to generate seemingly-trustworthy and realistic-looking reviews. These elite Sybil accounts taken together form a large-scale sparsely-knit Sybil network for which existing Sybil fake-review defense systems are unlikely to succeed. In this paper, we conduct the first study to define, characterize, and detect elite Sybil attacks. We show that contemporary elite Sybil attacks have a hybrid architecture, with the first tier recruiting elite Sybil workers and distributing tasks by Sybil organizers, and with the second tier posting fake reviews for profit by elite Sybil workers. We design ElsieDet, a three-stage Sybil detection scheme, which first separates out suspicious groups of users, then identifies the campaign windows, and finally identifies elite Sybil users participating in the campaigns. We perform a large-scale empirical study on ten million reviews from Dianping, by far the most popular URSN service in China. Our results show that reviews from elite Sybil users are more spread out temporally, craft more convincing reviews, and have higher filter bypass rates. We also measure the impact of Sybil campaigns on various industries (such as cinemas, hotels, restaurants) as well as chain stores, and demonstrate that monitoring elite Sybil users over time can provide valuable early alerts against Sybil campaigns.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2; 2025: 1.
5 papers.
- 2021Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networkscited by 38
- 2024Learn To be Efficient: Build Structured Sparsity in Large Language Modelscited by 19
- 2024SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learningcited by 12
- 2022Co-Membership-based Generic Anomalous Communities Detectioncited by 0
- 2025SCFCRC: Simultaneously Counteract Feature Camouflage and Relation Camouflage for Fraud Detectioncited by 0
- 2025SCFCRC: Simultaneously Counteract Feature Camouflage and Relation Camouflage for Fraud Detection21 Jan 2025
- 2024SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning17 Jun 2024
- 2024Learn To be Efficient: Build Structured Sparsity in Large Language Models9 Feb 2024
- 2022Co-Membership-based Generic Anomalous Communities Detection30 Mar 2022
- 2021Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks16 Apr 2021