TESLA-Based Defense Against Pollution Attacks in P2P Systems With Network Coding

In this paper, the authors propose a novel, complete defense system for network coding-based P2P systems that can quickly detect corrupted blocks, precisely identify the attackers, thereby eliminating them from the network, resist arbitrary collusion, and work with unknown, dynamic topologies, as it is the case in P2P systems. Their scheme uses and builds on two key ingredients: homomorphic message authentication codes and time asymmetry (as in TESLA) to provide source authentication for the detection scheme and non-repudiation for the identification scheme. Their mechanisms introduce significantly less communication and computation overhead than other comparable state-of-the-art schemes for P2P systems.

Provided by: University of Calgary Topic: Networking Date Added: May 2011 Format: PDF

Find By Topic