Efficient Secure Message Routing for Structured Peer-to-Peer Systems

Author

Xiang, Xu ; Jin, Tan

Author_Institution

Sch. of Comput. Eng., China JiLiang Univ., Hangzhou

Volume

2

fYear

2009

fDate

25-26 April 2009

Firstpage

354

Lastpage

357

Abstract

In structured P2P systems, peers and keys of content objects are identified using a set of well defined IDs. Queries are routed towards the target with a certain ID. When one ore more nodes are malicious, they may prevent correct message routing. Alternate routing pathes can be used to circumvent them. As a result, the routing latency consists of two parts: normal routing latency and extra routing latency incurred by bypassing malicious nodes.In this paper, we propose tracer routing, an efficient routing strategy designed to control the routing path while reducing the normal routing latency. Combined with a peer-ID based signature scheme, it can offer the initiator of each query to identify malicious nodes. A key feature of our scheme from other protocols is that alternate routing is constructed only detecting malicious nodes. Our simulation show that the routing success rate our scheme can achieve is better than previous protocols.

Keywords

peer-to-peer computing; query processing; telecommunication network routing; malicious nodes; peer-to-peer systems; query; secure message routing; tracer routing; Bandwidth; Communication system security; Computer networks; Computer security; Costs; Delay; Intrusion detection; Peer to peer computing; Routing protocols; Wireless communication; Peer-to-Peer; Routing; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-4223-2

Type

conf

DOI

10.1109/NSWCTC.2009.124

Filename

4908478