Attacking the Kad network-real world evaluation and high fidelity simulation using DVN

被引:3
作者
Wang, Peng [1 ]
Tyra, James [1 ]
Chan-Tin, Eric [1 ]
Malchow, Tyson [1 ]
Kune, Denis Foo [1 ]
Hopper, Nicholas [1 ]
Kim, Yongdae [1 ]
机构
[1] Univ Minnesota, Dept Comp Sci, St Paul, MN USA
关键词
P2P; Kad; simulation; attack; security;
D O I
10.1002/sec.172
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 16000 nodes connected to the operational Kad network. Using our large-scale simulator, DVN, we successfully scaled up to a 200000 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 (c) 2010 John Wiley & Sons, Ltd.
引用
收藏
页码:1556 / 1575
页数:20
相关论文
共 40 条
  • [31] Sit E, 2002, INT WORKSH PEER TO P
  • [32] Steiner M., 2007, DBISP2P 2007 5 INT W
  • [33] Steiner M, 2007, INT WORKSH PEER TO P
  • [34] Steiner M, 2007, 2358 EURECOM I EUR
  • [35] Steiner M, 2007, IMC'07: PROCEEDINGS OF THE 2007 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P117
  • [36] Stutzbach D, 2006, ACM SIGCOMM C INT ME
  • [37] Stutzbach Daniel., 2006, INFOCOM
  • [38] Scalability and accuracy in a large-scale network emulator
    Vahdat, A
    Yocum, K
    Walsh, K
    Mahadevan, P
    Kostic, D
    Chase, J
    Becker, D
    [J]. USENIX ASSOCIATION PROCEEDINGS OF THE FIFTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, 2002, : 271 - 284
  • [39] Yang W, 2005, IEEE INT S MOD AN SI
  • [40] Yu H, 2008, 2008 IEEE S SEC PRIV