STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Computational Puzzles as Sybil Defenses
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Operating system support for planetary-scale network services
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Proceedings of the 1st Workshop on Social Network Systems
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
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
An analysis of social network-based Sybil defenses
Proceedings of the ACM SIGCOMM 2010 conference
Designs to account for trust in social network-based sybil defenses
Proceedings of the 17th ACM conference on Computer and communications security
Measuring the mixing time of social graphs
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Secure routing strategies in DHT-based systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
Comet: an active distributed key-value store
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
Chord-PKI: A distributed trust infrastructure based on P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Canal: scaling social network-based Sybil tolerance schemes
Proceedings of the 7th ACM european conference on Computer Systems
Leveraging trust and distrust for sybil-tolerant voting in online social media
Proceedings of the 1st Workshop on Privacy and Security in Online Social Media
Aiding the detection of fake accounts in large scale social online services
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
GAUR: a method to detect Sybil groups in peer-to-peer overlays
International Journal of Grid and Utility Computing
SybilControl: practical sybil defense with computational puzzles
Proceedings of the seventh ACM workshop on Scalable trusted computing
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
Cachet: a decentralized architecture for privacy preserving social networking with caching
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Persea: a sybil-resistant social DHT
Proceedings of the third ACM conference on Data and application security and privacy
Modeling Decentralized Reputation-Based Trust for Initial Transactions in Digital Environments
ACM Transactions on Internet Technology (TOIT)
Iolaus: securing online content rating systems
Proceedings of the 22nd international conference on World Wide Web
Leveraging Social Feedback to Verify Online Identity Claims
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |
Whanau is a novel routing protocol for distributed hash tables (DHTs) that is efficient and strongly resistant to the Sybil attack. Whanau uses the social connections between users to build routing tables that enable Sybil-resistant lookups. The number of Sybils in the social network does not affect the protocol's performance, but links between honest users and Sybils do.When there are n well-connected honest nodes, Whanau can tolerate up to O(n/ log n) such "attack edges". This means that an adversary must convince a large fraction of the honest users to make a social connection with the adversary's Sybils before any lookups will fail. Whanau uses ideas from structured DHTs to build routing tables that contain O(√n log n) entries per node. It introduces the idea of layered identifiers to counter clustering attacks, a class of Sybil attacks challenging for previous DHTs to handle. Using the constructed tables, lookups provably take constant time. Simulation results, using social network graphs from LiveJournal, Flickr, YouTube, and DBLP, confirm the analytic results. Experimental results on PlanetLab confirmthat the protocol can handle modest churn.