Communications of the ACM
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Self-certifying file system
Spreading Activation Models for Trust Propagation
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
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
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Analysis of the HIP base exchange protocol
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on 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
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
Exploiting KAD: possible uses and misuses
ACM SIGCOMM Computer Communication Review
Flexible security in peer-to-peer applications: Enabling new opportunities beyond file sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Persistent personal names for globally connected mobile devices
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
On spreading recommendations via social gossip
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 1st Workshop on Social Network Systems
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Random Visitor: Defense against Identity Attacks in P2P Networks
IEICE - Transactions on Information and Systems
Secure routing in peer-to-peer distributed hash tables
Proceedings of the 2009 ACM symposium on Applied Computing
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Proceedings of the 16th ACM conference on Computer and communications security
Membership-concealing overlay networks
Proceedings of the 16th ACM conference on Computer and communications security
Random visitor: a defense against identity attacks in P2P overlay networks
WISA'06 Proceedings of the 7th international conference on Information security applications: PartI
Availability for DHT-based overlay networks with unidirectional routing
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
Sybil attacks against mobile users: friends and foes to the rescue
INFOCOM'10 Proceedings of the 29th conference on Information communications
Whanau: a sybil-proof distributed hash table
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Veracity: practical secure network coordinates via vote-based agreements
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
How to share your favourite search results while preserving privacy and quality
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
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
Repelling Sybil-type attacks in wireless ad hoc systems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
Private yet abuse resistant open publishing
Proceedings of the 15th international conference on Security protocols
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Securing P2P systems from Sybil attacks through adaptive identity management
Proceedings of the 7th International Conference on Network and Services Management
Valet services: improving hidden servers with a personal touch
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
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
| Hi-index | 0.00 |
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in open networks, where an adversary can perform a sybil attack by introducing a large number of corrupt nodes in the network, considerably degrading its performance. We introduce a routing strategy that alleviates some of the effects of such an attack by making sure that lookups are performed using a diverse set of nodes. This ensures that at least some of the nodes queried are good, and hence the search makes forward progress. This strategy makes use of latent social information present in the introduction graph of the network.