Random network coding against the eavesdropping adversaries
Ma Jianfeng · Journal of Xidian University · 2009
An algorithm against eavesdropping adversaries is presented.By means of this algorithm an eavesdropper is unable to get any meaningful information about the source,which we call practical security.We show that if we give up a small amount of overall capacity,then a random code achieves the practically secure condition at a much higher probability.When there is a low rate secret channel between the source and destination,the shared secret algorithm not only achieves the max-flow but also the practically secure condition at a probability of one.Furthermore,implementing the algorithm involves only a slight modification of the source and destination with the operations at the intermediate nodes remaining unchanged.