Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing

S. Kullback, Information Theory and Statistics . Dover Publications, 1968

1968

Earlier work this paper cites.

A. D. Wyner, “The wiretap channel,” Bell System Technical Journal , vol. 54, no. 8, pp. 1355–1367, October 1975

Original

1975

Earlier work this paper cites.

S. Leung-Yan-Cheong, “Multi-user and wiretap channels including feedback,” Ph. D. Dissertation, Stanford University , 1976

1976

Earlier work this paper cites.

I. Csiszar and J. Korner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 24, no. 3, pp. 339–348, May 1978

1978

Earlier work this paper cites.

S. Leung-Yan-Cheong and M. Hellman, “The Gaussian wiretap channel,” IEEE Trans. Inf. Theory , vol. 24, no. 4, pp. 451–456, 1978

1978

Earlier work this paper cites.

R. Ahlswede and I. Csiszár, “Common randomness in information theory and cryptography–part i: Secret sharing,” IEEE Trans. Inf. Theory , vol. 39, no. 4, pp. 1121–1132, July 1993

1993

Earlier work this paper cites.

U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 733–742, May 1993

1993

Earlier work this paper cites.

I. Csiszár, “Almost independence and secrecy capacity,” Prob. Pered. Inform. , vol. 32, no. 1, pp. 48–57, 1996

1996

Cited alongside, same era.

H. Nagaoka, “Strong converse theorems in quantum information theory,” in ERATO Workshop on Quantum Information Science 2001,Univ. Tokyo, Tokyo, Japan, September 6–8 , 2001, p. 33

2001

Cited alongside, same era.

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, April 2006

2006

Cited alongside, same era.

——, Quantum Information: An Introduction . Springer, 2006

2006

Cited alongside, same era.

——, “Discrimination of two channels by adaptive methods and its application to quantum system,” IEEE Trans. Inf. Theory , vol. 55, no. 8, pp. 3807–3820, Aug 2009

Y. Polyanskiy and S. Verdú, “Arimoto channel coding converse and Rényi divergence,” Proc. Conference on Communication, Control, and Computing (Allerton) , pp. 1327–1333, 2010

2010

Later among the works it cites.

H. Tyagi and P. Narayan, “How many queries will resolve common randomness?” IEEE Trans. Inf. Theory , vol. 59, no. 9, pp. 5363–5378, September 2013

2013

Later among the works it cites.

C. Morgan and A. Winter, ““pretty strong” converse for the quantum capacity of degradable channels,” IEEE Trans. Inf. Theory , vol. 60, no. 1, pp. 317–333, Jan 2014

2014

Closest in time.

V. Y. F. Tan and M. R. Bloch, “Information spectrum approach to strong converse theorems for degraded wiretap channels,” arXiv:1406.6758 , 2014

Original

2014

Closest in time.

H. Tyagi and S. Watanabe, “A bound for multiparty secret key agreement and implications for a problem of secure computing,” in Proc. EUROCRYPT , 2014, pp. 369–386