An Authentication Code against Pollution Attacks in Network Coding

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Systems exploiting network coding to increase their throughput suffer greatly from pollution attacks which consist of injecting malicious packets in the network. The pollution attacks are amplified by the network coding process, resulting in a greater damage than under traditional routing. In this paper, we address this issue by designing an unconditionally secure authentication code suitable for multicast network coding. The proposed scheme is robust against pollution attacks from outsiders, as well as coalitions of malicious insiders. Intermediate nodes can verify the integrity and origin of the packets received without having to decode, and thus detect and discard the malicious messages in-transit that fail the verification. This way, the pollution is canceled out before reaching the destinations. We analyze the performance of the scheme in terms of both multicast throughput and goodput, and show the goodput gains. We also discuss applications to file distribution.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Authentication Code against Pollution Attacks in Network Coding 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 An Authentication Code against Pollution Attacks in Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Authentication Code against Pollution Attacks in Network Coding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-390407

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.