On counteracting Byzantine attacks in network coded peer-to-peer networks

Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are particularly susceptible to Byzantine attacks. We quantify the impact of Byzantine attacks on the coded system by evaluating the probability that a receiver node fails to correctly recover a file. We show that even for a small probability of attack, the system fails with overwhelming probability. We then propose a novel signature scheme that allows packet-level Byzantine detection. This scheme allows one-hop containment of the contamination, and saves bandwidth by allowing nodes to detect and drop the contaminated packets. We compare the net cost of our signature scheme with various other Byzantine schemes, and show that when the probability of Byzantine attacks is high, our scheme is the most bandwidth efficient.

• Type: Journal
• Year: 2010
• Where: JSAC
• Authors: MinJi Kim, Luísa Lima, Fang Zhao, João Barros, Muriel Médard, Ralf Koetter, Ton Kalker, Keesook J. Han
• Keywords: Byzantine Attacks, JSAC 2010, Packet-level Byzantine Detection, Signature Scheme