A previous version of this paper has appeared at SecureComm 2008.
Special Issue Paper
Attacking the kad network—real world evaluation and high fidelity simulation using DVN†
Article first published online: 24 DEC 2009
Copyright © 2010 John Wiley & Sons, Ltd.
Security and Communication Networks
Volume 6, Issue 12, pages 1556–1575, December 2013
How to Cite
Wang, P., Tyra, J., Chan-Tin, E., Malchow, T., Kune, D. F., Hopper, N. and Kim, Y. (2013), Attacking the kad network—real world evaluation and high fidelity simulation using DVN. Security Comm. Networks, 6: 1556–1575. doi: 10.1002/sec.172
- Issue published online: 24 DEC 2009
- Article first published online: 24 DEC 2009
- Manuscript Accepted: 26 OCT 2009
- Manuscript Revised: 4 AUG 2009
- Manuscript Received: 10 MAR 2009
- NSF. Grant Number: CNS-0716025
- KISA (Korea Information Security Agency)
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. Using our large-scale simulator, DVN, we successfully scaled up to a 200 000 node experiment. 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. Copyright © 2010 John Wiley & Sons, Ltd.