The Exclusion of Malicious Routing Peers in Structured P2P Systems

Authors:
Bong-Soo Roh;O-Hoon Kwon;Sung Je Hong;Jong Kim
Affiliations:
Dept. of Computer Science and Engineering, Pohang University of Science and Technology,;Dept. of Computer Science and Engineering, Pohang University of Science and Technology,;Dept. of Computer Science and Engineering, Pohang University of Science and Technology,;Dept. of Computer Science and Engineering, Pohang University of Science and Technology,
Venue:
Agents and Peer-to-Peer Computing
Year:
2006

Citing 7
Cited 0

A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Security Considerations for Peer-to-Peer Distributed Hash Tables

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis

ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Secure routing for structured peer-to-peer overlay networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a scheme which excludes malicious routing peers from the normal routing process of structured P2P systems such as Chord. This scheme prevents continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.