The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
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
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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
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
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
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
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
CAPTCHA: using hard AI problems for security
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random sampling key revocation scheme for distributed sensor networks
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
Security challenges for reputation mechanisms using online social networks
Proceedings of the 2nd ACM workshop on Security and artificial intelligence
Collaborative scoring with dishonest participants
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A novel defense mechanism against sybil attacks in VANET
Proceedings of the 3rd international conference on Security of information and networks
Privacy and security for online social networks: challenges and opportunities
IEEE Network: The Magazine of Global Internetworking
Measuring the mixing time of social graphs
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Context based trust normalization in service-oriented environments
ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
False-name-proofness in social networks
WINE'10 Proceedings of the 6th international conference on Internet and network economics
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
Who moderates the moderators?: crowdsourcing abuse detection in user-generated content
Proceedings of the 12th ACM conference on Electronic commerce
Social network analysis on KAD and its application
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
The GOSSPLE anonymous social network
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
Social market: combining explicit and implicit social networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Decentralized polling with respectable participants
Journal of Parallel and Distributed Computing
Guard your connections: infiltration of a trust/reputation based network
Proceedings of the 3rd Annual ACM Web Science Conference
Immunizing mobile ad hoc networks against collaborative attacks using cooperative immune model
Security and Communication Networks
Proceedings of the 22nd international conference on World Wide Web companion
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
Preventing spam in opportunistic networks
Computer Communications
| Hi-index | 0.00 |
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By controlling a large fraction of the nodes in the system, the malicious user is able to "out vote" the honest users in collaborative tasks such as Byzantine failure defenses. This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks. Our protocol is based on the "social network" among user identities, where an edge between two identities indicates a human-established trust relationship. Malicious users can create many identities but few trust relationships. Thus, there is a disproportionately small "cut" in the graph between the sybil nodes and the honest nodes. SybilGuard exploits this property to bound the number of identities a malicious user can create. We show the effectiveness of SybilGuard both analytically and experimentally.