[CSC2231] Paper Review: Secure Routing for Structured Peer-to-Peer Overlay Networks

From: Kenneth Po <kpo_REMOVE_THIS_FROM_EMAIL_FIRST_at_eecg.toronto.edu>
Date: Thu, 17 Nov 2005 10:49:51 -0500

This is a mouse-and-cat attack-defense style paper on security of P2P
systems. The paper identifies problems with node ID generation, routing
table maintenance, and message delivery and provides solutions to these
problems.

Generating node ID from a node's IP address is an easy trick to deal
with the node ID problem. However, this does not prevent the attacker to
use a handful of zombie machines all over the world to attack a P2P
system. The solution to the routing table maintenance problem is built
upon the solution of the node ID generation problem. The problem may be
worse if the zombie machines really have the proximity advantage. The
redundant routing solution to the message delivery problem is like
telling a node not to play by the rules of the P2P protocol but doing
some random messaging. I'd suggest a voting mechanism to drop the faulty
nodes from the overlay so that the data can be redistributed and
messages are delivered normally.
Received on Thu Nov 17 2005 - 10:50:01 EST

This archive was generated by hypermail 2.2.0 : Thu Nov 17 2005 - 10:51:21 EST