The Secure Routing Mechanism for DHT-based Overlay Network

Author

Kwon, Hyeokchan ; Koh, Sunkee ; Nah, Jaehoon ; Jang, Jongsoo

Author_Institution

Electron. & Telecommun. Res. Inst. (ETRI), Daejeon

Volume

2

fYear

2008

fDate

17-20 Feb. 2008

Firstpage

1300

Lastpage

1303

Abstract

For routing and lookup efficiency, DHT-based overlay network has been developed. The representative DHT-based overlay networks are Kad, Chord, Pastry and CAN. And Several applications such as file sharing, distributed storage system have been developed on the DHT-baed overlay network. But there exist several security attacks on the DHT-based overlay network: Peer ID attack, Attacks on message routing, Rapid join/leave attack, DoS attack and so on. In this paper, we propose secure routing mechanism against message routing attacks for DHT-based overlay network. The proposed mechanism ensures that when a normal peer sends a lookup messages using a key, the messages delivered to the peer which is owner of the key with very high probability.

Keywords

cryptography; peer-to-peer computing; probability; table lookup; telecommunication network routing; telecommunication security; CAN network; Chord network; DHT-based overlay network; DoS attack; Kad network; Pastry network; lookup delegation; message routing attacks; peer ID attack; probability; rapid join-leave attack; recursive hash function; secure routing mechanism; security attacks; Arithmetic; Computer crime; Fingers; Large-scale systems; Peer to peer computing; Routing; DHT; Overlay Network; P2P; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference on

Conference_Location

Gangwon-Do

ISSN

1738-9445

Print_ISBN

978-89-5519-136-3

Type

conf

DOI

10.1109/ICACT.2008.4494002

Filename

4494002