Secure Multiplex Coding with a Common Message
Information Theory
2011-11-09 v3 Cryptography and Security
math.IT
Abstract
We determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not evaluated by Yamamoto et al.
Cite
@article{arxiv.1101.4036,
title = {Secure Multiplex Coding with a Common Message},
author = {Ryutaroh Matsumoto and Masahito Hayashi},
journal= {arXiv preprint arXiv:1101.4036},
year = {2011}
}
Comments
5 pages, no figure, IEEEtran.sty, final version to appear in Proc. ISIT 2011