Paper Info
Title
On counteracting Byzantine attacks in network coded peer-to-peer networks
Abstract
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.
Year
DOI
Venue
2010
10.1109/JSAC.2010.100607
IEEE Journal on Selected Areas in Communications
Keywords
DocType
Volume
content distribution,byzantine attacks,content distribution.,distributed storage,byzantine,overwhelming probability,novel signature scheme,security,byzantine scheme,packet-level byzantine detection,one-hop containment,network coding,one hop containment,network code,computer network security,signature scheme,peer-to-peer network,contaminated packet,random linear network coding,byzantine attack,small probability,peer to peer,packet level byzantine detection,peer-to-peer networks,peer-to-peer computing,index terms—network coding
Journal
28
Issue
ISSN
Citations 
5
0733-8716
18
PageRank 
References 
Authors
0.97
22
8
Name
Order
Citations
PageRank
MinJi Kim117415.30
Luísa Lima220812.50
Fang Zhao339523.98
João Barros42087126.60
Muriel Médard56828599.31
Ralf Koettery65019456.62
Ton Kalker71203140.78
Keesook J. Han81289.83