Computation of the random coding secrecy exponent for a constant composition ensemble

Yutaka Jitsumatsu

doi:10.1109/ISIT.2017.8006822

Computation of the random coding secrecy exponent for a constant composition ensemble

Yutaka Jitsumatsu

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1713-1717
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006822
Publication status	Published - Aug 9 2017
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: Jun 25 2017 → Jun 30 2017

Other

Other	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country	Germany
City	Aachen
Period	6/25/17 → 6/30/17

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2017.8006822

Fingerprint Dive into the research topics of 'Computation of the random coding secrecy exponent for a constant composition ensemble'. Together they form a unique fingerprint.

Cite this

Jitsumatsu, Y 2017, Computation of the random coding secrecy exponent for a constant composition ensemble. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006822, Institute of Electrical and Electronics Engineers Inc., pp. 1713-1717, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8006822

@inproceedings{8be48838a26d4bec8837ee7722a85c13,

title = "Computation of the random coding secrecy exponent for a constant composition ensemble",

abstract = "Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.",

author = "Yutaka Jitsumatsu",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006822",

language = "English",

pages = "1713--1717",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

}

TY - GEN

T1 - Computation of the random coding secrecy exponent for a constant composition ensemble

AU - Jitsumatsu, Yutaka

PY - 2017/8/9

Y1 - 2017/8/9

N2 - Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.

AB - Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.

UR - http://www.scopus.com/inward/record.url?scp=85034053000&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034053000&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2017.8006822

DO - 10.1109/ISIT.2017.8006822

M3 - Conference contribution

AN - SCOPUS:85034053000

SP - 1713

EP - 1717

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -