SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
No Thumbnail Available
Date
2008-02-05
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to {\em sybil attacks}, where a malicious user
pretends to have multiple identities (called {\em sybil nodes}). Without a trusted central authority, defending against sybil attacks is quite challenging. Among the small number of decentralized approaches, our recent SybilGuard protocol leverages a key insight on social networks to bound the number of sybil nodes accepted. Although its direction is promising, SybilGuard can allow a large number of sybil nodes to be accepted. Furthermore, SybilGuard assumes that social networks are fast mixing, which has never been confirmed in the real world.
This paper presents the novel SybilLimit protocol that leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees. The number of sybil nodes accepted is reduced by a factor of
$\Theta(\sqrt{n})$, or around 200 times in our experiments for a million-node system. We further prove that SybilLimit's guarantee is at
most a $\log n$ factor away from optimal, when considering approaches based on fast-mixing social networks. Finally, based on three large-scale real-world social networks, we provide the first evidence that real-world social networks are indeed fast mixing. This validates the fundamental assumption behind SybilLimit's and SybilGuard's approach.