A construction of universal secure network coding
Abstract
We construct a universal secure network coding. Our construction just modifies the transmission scheme at the source node and works with every linear coding at an intermediate node. We relax the security criterion such that the mutual information between the message and the eavesdropped signal is sufficiently small instead of strictly zero. Our construction allows the set of eavesdropped links to change at each time slot.
Cite
@article{arxiv.1006.4703,
title = {A construction of universal secure network coding},
author = {Ryutaroh Matsumoto},
journal= {arXiv preprint arXiv:1006.4703},
year = {2011}
}
Comments
This paper has been withdrawn by the author. The proof technique in this paper does not ensure the existence of a coding scheme that is secure against all the eavesdropping matrices of rank less than or equal to \mu, which means that the proof does not prove the universal security as originally claimed. A much extended and corrected version of this paper was registered as arXiv:1102.3002. The author appreciates the helpful comment by Dr. Jun Muramatsu