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

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.