Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
Daisuke Kobayashi, Hirosuke Yamamoto, Tomohiro Ogawa
IEEE Transactions on Information Theory,
Vol. 59,
No.12, pp.8131-8143, December 2013
It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_{S}$, which is usually smaller than the channel capacity $C$. In order to remove the loss $C-C_{S}$ , we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each massage. Several bounds of achievable multiplex coding rate region are derived for general wiretap channels in the sense of information-spectral methods, by extending Hayashi's proof, in which the coding of the channel resolvability is applied to wiretap channels. Furthermore, the exact region for deterministic coding is determined for stationary memoryless full-rank wiretap channels.
Index Terms : Channel resolvability, information-spectrum method, multiplex coding, secrecy capacity, wiretap channe.
Final submission version (PDF) (168 Kbytes)
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
DOI: 10.1109/TIT.2013.2282673