Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
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
Defending against eclipse attacks on overlay networks
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Exploiting P2P systems for DDoS attacks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
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
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Evaluation of Sybil Attacks Protection Schemes in KAD
AIMS '09 Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security: Scalability of Networks and Services
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Avoiding eclipse attacks on kad/kademlia: an identity based approach
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
Computer Communications
Winnowing: Protecting P2P systems against pollution through cooperative index filtering
Journal of Network and Computer Applications
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The Kad network, an implementation of the Kademlia DHT protocol, supports the popular eDonkey peer-to-peer file sharing network and has over 1 million concurrent nodes. We describe several attacks that exploit critical design weaknesses in Kad to allow an attacker with modest resources to cause a significant fraction of all searches to fail. We measure the cost and effectiveness of these attacks against a set of 16,000 nodes connected to the operational Kad network. We also measure the cost of previously proposed, generic DHT attacks against the Kad network and find that our attacks are much more cost effective. Finally, we introduce and evaluate simple mechanisms to significantly increase the cost of these attacks.