EDBT 2026 Demo / reviewers in the wild / expert
Yuanli Miao
dblp:252/4241
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Web and mobile security · 67% Network security · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Web and mobile security › online social network security
fake account detection |
0.4 | 1 | 2019 | Detecting Fake Accounts in Online Social Networks at the Time of Registrations · CCS 2019 |
Web and mobile security
online social network security |
0.4 | 1 | 2019 | Detecting Fake Accounts in Online Social Networks at the Time of Registrations · CCS 2019 |
Network security › intrusion detection and prevention
sybil attack detection |
0.4 | 1 | 2019 | Detecting Fake Accounts in Online Social Networks at the Time of Registrations · CCS 2019 |
Methods — techniques the papers use, named apart from their topics
graph inference · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Detecting Fake Accounts in Online Social Networks at the Time of RegistrationsabstractOnline social networks are plagued by fake information. In particu- lar, using massive fake accounts (also called Sybils), an attacker can disrupt the security and privacy of benign users by spreading spam, malware, and disinformation. Existing Sybil detection methods rely on rich content, behavior, and/or social graphs generated by Sybils. The key limitation of these methods is that they incur significant delays in catching Sybils, i.e., Sybils may have already performed many malicious activities when being detected. In this work, we propose Ianus, a Sybil detection method that leverages account registration information. Ianus aims to catch Sybils immediately after they are registered. First, using a real- world registration dataset with labeled Sybils from WeChat (the largest online social network in China), we perform a measurement study to characterize the registration patterns of Sybils and benign users. We find that Sybils tend to have synchronized and abnormal registration patterns. Second, based on our measurement results, we model Sybil detection as a graph inference problem, which allows us to integrate heterogeneous features. In particular, we extract synchronization and anomaly based features for each pair of accounts, use the features to build a graph in which Sybils are densely connected with each other while a benign user is isolated or sparsely connected with other benign users and Sybils, and finally detect Sybils via analyzing the structure of the graph. We evaluate Ianus using real-world registration datasets of WeChat. Moreover, WeChat has deployed Ianus on a daily basis, i.e., WeChat uses Ianus to analyze newly registered accounts on each day and detect Sybils. Via manual verification by the WeChat security team, we find that Ianus can detect around 400K per million new registered accounts each day and achieve a precision of over 96% on average. Dong Yuan 0006, Yuanli Miao, Neil Zhenqiang Gong, Qi Li 0002, Dawn Song, Qian Wang 0002 |
CCS | 2 |