The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems (TOCS)
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding the network-level behavior of spammers
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Experience with an object reputation system for peer-to-peer filesharing
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Exploiting KAD: possible uses and misuses
ACM SIGCOMM Computer Communication Review
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
DSybil: Optimal Sybil-Resistance for Recommendation Systems
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
CAPTCHA: using hard AI problems for security
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Informant: detecting sybils using incentives
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
False-name-proofness in social networks
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
An anti-collusion trust model in P2P networks
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Social market: combining explicit and implicit social networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Addressing common vulnerabilities of reputation systems for electronic commerce
Journal of Theoretical and Applied Electronic Commerce Research
Proceedings of the 22nd international conference on World Wide Web companion
SGor: Trust graph based onion routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
| Hi-index | 0.00 |
Open-access distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user creates multiple fake identities (called sybil nodes). Without a trusted central authority that can tie identities to real human beings, 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. Despite its promising direction, 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 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.