On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks

• Type: Article in International Scientific Journal
• Date: 2009

Authors

MinJi Kim (Author) Other; Luisa Lima (Author) FEUP; Fang Zhao (Author) Other; João Barros (Author) FEUP; Muriel Médard (Author) Other; Ralf Koetter (Author) Other; Ton Kalker (Author) Other; Keesook J. Han (Author) Other

Journal

Title: IEEE Journal on Selected Areas in Communications

Vol. 28 No. 5

Pages: 692-702

ISSN: 0733-8716

Publisher: IEEE

Indexing

ISI Web of Science

Scopus

INSPEC

COMPENDEX

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Engineering > Electrical engineering

Other information

DOI: 10.1109/JSAC.2010.100607

Abstract (EN): Random linear network coding can be used in peer-to-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.

Language: English

Type (Professor's evaluation): Scientific