Sciweavers

Share
SP
2008
IEEE

SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks

8 years 8 months ago
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
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 [42] 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 Θ( √ n), or around 200 times in our experiments for a million-node system. We further prove th...
Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky,
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where SP
Authors Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, Feng Xiao
Comments (0)
books