Secure multiplex coding attaining channel capacity in wiretap channels

IEEE Transactions on Information Theory

Volumn 59, Issue 12, 2013, Pages 8131-8143

  Kobayashi, Daisuke ^a   Yamamoto, Hirosuke ^b   Ogawa, Tomohiro ^c  

^a NTT DATA   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Channel resolvability; Information spectrum method; Multiplex coding; Secrecy capacity; Wiretap channel

Indexed keywords

CHANNEL RESOLVABILITY; CODING RATE; CODING SCHEME; INFORMATION-SPECTRUM METHOD; NOISY CHANNEL; PERFECT SECRECY; SECRECY CAPACITY; WIRE-TAP CHANNELS; INFORMATION SPECTRUM; SPECTRAL METHODS;

CHANNEL CAPACITY; MULTIPLEXING; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY);

CHANNEL CODING;

EID: 84889581480     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2282673     Document Type: Article

References (17)

1. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, 1975.
2. T. M. Cover and J. A. Thomas, Elements of Information Theory, Second ed. New York, NY, USA: Wiley, 2006.
3. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1978.
4. U. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
5. T. S. Han, Information-Spectrum Methods in Information Theory. New York, NY, USA: Springer-Verlag, 2003.
6. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
7. R. Ahlswede and G. Dueck, "Identification via channels," IEEE Trans. Inf. Theory, vol. 35, no. 1, pp. 5-29, Jan. 1989.
8. I. Devetak, "The private classical information capacity and quantum information capacity of a quantum channel," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 44-55, Jan. 2005. (Pubitemid 40145986)
9. M. Hayashi, "General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, Apr. 2006.
10. T. S. Han and S. Verdú, "Spectrum invariancy under output approximation for full-rank discrete memoryless channels," Probl. Peredachi Inf., vol. 29, no. 2, pp. 9-27, 1993.
11. L. H. Ozarow and A. D. Wyner, "Wire-tap channel II," in Advances in Cryptology, 1985, vol. 209, pp. 33-50.
12. A. Barg and G. D. Forney, "Random codes: minimum distance and error exponent," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2568-2573, Sep. 2002. (Pubitemid 35032681)
13. Y. Chen and A. J. H. Vinck, "Secrecy coding for the binary symmetric wiretap channel," Security Commun. Netw., vol. 4, no. 8, pp. 966-978, Aug. 2011.
14. U. Maurer and S. Wolf, "Information-theoretic key agreement: From week to strong secrecy for free," in Proc. 19th Int. Conf. Theory Appl. Cryptographic Tech., 2000, pp. 351-368, 1807.
15. H. Yamamoto, "Secret sharing system using threshold scheme," (in Japanese) Trans. IECE Jpn., vol. J68-A, no. 9, pp. 945-952, 1985, (English translation: Electronics and Communications in Japan, Part I, vol. 69, no. 9, pp. 46-54, Scripta Technica, Inc., 1986).
16. K. Harada and H. Yamamoto, "Strongly secure linear network coding," IEICE Trans. Fund., vol. E91, no. 10, pp. 2720-2728, 2008.
17. H. Yamamoto and D. Isami, "Multiplex coding of bit commitment based on a discrete memoryless channel," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 721-725.