Exponential decreasing rate of leaked information in universal random privacy amplification

R. G. Gallager, Information Theory and Reliable Communication

1968

Earlier work this paper cites.

A. D. Wyner, “The wire-tap channel,” Bell. Sys. Tech. Jour

1975

Earlier work this paper cites.

I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inform. Theory

1979

Earlier work this paper cites.

L. Carter and M. Wegman, “Universal classes of hash functions,” J. Comput. Sys. Sci.,

1979

Earlier work this paper cites.

I. Csiszár and J. Körner, Information theory: Coding Theorem for Discrete Memoryless systems

1981

Earlier work this paper cites.

P. Delsarte and P. Piret, “Algebraic constructions of Shannon codes for regular channels,” IEEE Trans. Inform. Theory

1982

Earlier work this paper cites.

U. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inform. Theory

1993

Earlier work this paper cites.

R. Ahlswede and I. Csiszár, “Common randomness in information theory and cryptography part 1: Secret sharing,” IEEE Trans. Inform. Theory

1993

Earlier work this paper cites.

H. Krawczyk. LFSR-based hashing and authentication. Advances in Cryptology — CRYPTO ’94. Lecture Notes in Computer Science, vol. 839, Springer-Verlag, pp 129–139, 1994

1994

Cited alongside, same era.

C.H.Bennett, G. Brassard, C. Crepeau, and U.M. Maurer, “Generalized privacy amplification,” IEEE Trans. Inform. Theory

1995

Cited alongside, same era.

I. Csiszár, “Almost Independence and Secrecy Capacity,” Problems of Information Transmission

1996

Cited alongside, same era.

S. Amari and H. Nagaoka, Methods of Information Geometry

2000

Cited alongside, same era.

R. Cannetti, “Universal composable security: a new paradigm for cryptographic protocols,” Proc. 42nd IEEE FOCS

2001

Cited alongside, same era.

I. Devetak, “The private classical information capacity and quantum information capacity of a quantum channel,” IEEE Trans. Inform. Theory

2005

Later among the works it cites.

R. Renner, “Security of Quantum Key Distribution,” PhD thesis, Dipl. Phys. ETH, Switzerland, 2005. arXiv:quantph/0512258

2005

Later among the works it cites.

R. Renner and S. Wolf, “Simple and Tight Bounds for Information Reconciliation and Privacy Amplification,” ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 199-216, 2005

2005

Later among the works it cites.

M. Hayashi, “General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and its application to wire-tap channel,” IEEE Trans. Inform. Theory

2006

Later among the works it cites.

J. Muramatsu. “Secret key agreement from correlated source outputs using low density parity check matrices,” IEICE Trans. Fundamentals