SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Haifeng Yu
Gibbons, P.B.
Kaminsky, M.
Feng Xiao
Nat. Univ. of Singapore, Singapore;
This paper appears in: Security and Privacy, 2008. SP 2008. IEEE Symposium on
Publication Date: 18-22 May 2008
On page(s): 3-17
Location: Oakland, CA,
ISSN: 1081-6011
ISBN: 978-0-7695-3168-7
INSPEC Accession Number: 10008061
Digital Object Identifier: 10.1109/SP.2008.13
Current Version Published: 2008-05-28
Abstract
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called 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 [H. Yu et al., 2006] 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 ominus(radicn), 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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
