Secure Multiplex Network Coding
Information Theory
2011-11-09 v3 Cryptography and Security
math.IT
Abstract
In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.
Cite
@article{arxiv.1102.3002,
title = {Secure Multiplex Network Coding},
author = {Ryutaroh Matsumoto and Masahito Hayashi},
journal= {arXiv preprint arXiv:1102.3002},
year = {2011}
}
Comments
IEEEtran.sty, 7 pages, no figure, Version 2 will appear in Proc. NetCod 2011, Beijing, China. Version 3 adds an appendix proving that the mutual information can be made exactly zero