Attacking the kad network—real world evaluation and high fidelity simulation using DVN1. Issue 12 (24th December 2009)

• Record Type: Journal Article
• Authors: Wang, Peng; Tyra, James; Chan‐Tin, Eric; Malchow, Tyson; Kune, Denis Foo; Hopper, Nicholas; Kim, Yongdae
• Is Part Of: Security and communication networks. Volume 6:Issue 12(2013:Dec.)
• Page Start: 1556
• Page End: 1575
• Publication Date: 2009-12-24
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.172
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main" xml:lang="en" id="sec172-abs-0001"> <title>Abstract</title> <p id="sec172-para-0001">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 &amp; Sons, Ltd.</p> </abstract>