P2P Security Paper Review

From: Ali Akhavan <a.akhavan.b_REMOVE_THIS_FROM_EMAIL_FIRST_at_gmail.com>
Date: Thu, 17 Nov 2005 11:09:13 -0500

 The paper is working on finding solutions for possible attacks to the
existing models of p2p systems. In the case of faulty nodes in a P2P system,
these nodes may prevent objects to be located or replicated into desired
number of nodes. In general, these nodes may arbitrarily interfere with the
flow of data in a P2P system, if the system doesn't provide anti-attack
incentives.
 The key strength of the paper is that it exploits the distributed nature of
P2P systems to solve the faulty nodes attacks problem. More specifically,
the use of proximity aware routing to secure this protocol will work only in
a widely deployed P2P system for which nodes are distributed in geographic
regions.
 The paper is building its work upon the assumption that there exists and
effective method to make sure about the real identity of entities in a P2P
system, however, the paper does not further develop methods in this regard.
Paying money for identification is in contrast with the success of P2P
systems for which people use the overlay not to pay for songs!
Received on Thu Nov 17 2005 - 11:09:24 EST

This archive was generated by hypermail 2.2.0 : Thu Nov 17 2005 - 11:17:33 EST