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

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

2009-04-17

arxiv.org/abs/0904.2722v1

Computer Science

Networking and Internet Architecture

26 pages, 9 figures, Submitted to IEEE Journal on Selected Areas in Communications (JSAC) "Mission Critical Networking"

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141610