Effective Secrecy: Reliability, Confusion and Stealth

A. Wyner, “The wire-tap channel,” Bell Syst. Tech. Journal , vol. 54, no. 8, pp. 1355–1387, Oct. 1975

1975

Earlier work this paper cites.

I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 24, no. 3, pp. 339–348, May 1978

1978

Earlier work this paper cites.

T. Han and S. Verdú, “Approximation theory of output statistics,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 752–772, May 1993

1993

Earlier work this paper cites.

I. Csiszár, “Almost independence and secrecy capacity,” Prob. Inf. Trans. , vol. 32, no. 1, pp. 40–47, Jan.–March 1996

1996

Earlier work this paper cites.

J. L. Massey, Applied Digital Information Theory , ETH Zurich, Zurich, Switzerland, 1980-1998

1998

Earlier work this paper cites.

U. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,” in Advances in Cryptology - Eurocrypt 2000 . Lecture Notes in Computer Science, Springer-Verlag, 2000, pp. 351–368

2000

Cited alongside, same era.

A. Orlitsky and J. Roche, “Coding for computing,” IEEE Trans. Inf. Theory , vol. 47, no. 3, pp. 903–917, March 2001

2001

Cited alongside, same era.

A. Winter, “Secret, public and quantum correlation cost of triples of random variables,” in IEEE Int. Symp. Inf. Theory , Adelaide, Australia, Sept. 2005, pp. 2270–2274

2005

Cited alongside, same era.

E. L. Lehmann and J. P. Romano, Testing Statistical Hypotheses , 3rd ed. New York: Springer, 2005

2005

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

T. Cover and J. Thomas, Elements of Information Theory , 2nd ed. New York: Wiley, 2006

Original

2006

Later among the works it cites.

G. Kramer, “Teaching IT: An identity for the Gelfand-Pinsker converse,” IEEE Inf. Theory Society Newsletter , vol. 61, no. 4, pp. 4–6, Dec. 2011

2011

Later among the works it cites.

A. El Gamal and Y.-H. Kim, Network Information Theory . Cambridge University Press, 2011

2011

Later among the works it cites.

M. Bloch and N. Laneman, “Strong secrecy from channel resolvability,” IEEE Trans. Inf. Theory , vol. 59, no. 12, pp. 8077–8098, Dec. 2013

2013

Closest in time.

J. Hou and G. Kramer, “Informational divergence approximations to product distributions,” in 13th Canadian Workshop on Inf. Theory (CWIT) , Toronto, Canada, June 2013, pp. 76–81

2013