Secure Network Coding Against the Contamination and Eavesdropping Adversaries

Details Secure Network Coding Against the Contamination and Eavesdropping Adversaries Secure Network Coding Against the Contamination and Eavesdropping Adversaries

2008-05-15

arxiv.org/abs/0805.2286v1

Computer Science

Cryptography and Security

6 pages, 3 figures

Scientific paper

In this paper, we propose an algorithm that targets contamination and eavesdropping adversaries. We consider the case when the number of independent packets available to the eavesdropper is less than the multicast capacity of the network. By means of our algorithm every node can verify the integrity of the received packets easily and an eavesdropper is unable to get any meaningful information about the source. We call it practical security if an eavesdropper is unable to get any meaningful information about the source.We show that, by giving up a small amount of overall capacity, our algorithm achieves achieves the practically secure condition at a probability of one. Furthermore, the communication overhead of our algorithm are negligible compared with previous works, since the transmission of the hash values and the code coefficients are both avoided.

Affiliated with

Also associated with

No associations

Rating

Secure Network Coding Against the Contamination and Eavesdropping Adversaries 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 Secure Network Coding Against the Contamination and Eavesdropping Adversaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Network Coding Against the Contamination and Eavesdropping Adversaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509663