Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker

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

1975

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.

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

Earlier work this paper cites.

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

1995

Earlier work this paper cites.

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, “A Pseudorandom Generator from any One-way Function,” SIAM J. Comput. 28, 1364 (1999)

1999

Cited alongside, same era.

M. Hayashi, “Optimal sequence of POVMs in the sense of Stein’s lemma in quantum hypothesis,” J. Phys. A: Math. and Gen

2002

Cited alongside, same era.

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

2005

Cited alongside, same era.

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

Cited alongside, same era.

M. Hayashi, Quantum Information: An Introduction, Springer (2006)

2006

Cited alongside, same era.

M. Hayashi, “Tight exponential evaluation for information theoretical secrecy based on universal composablity,” arXiv:1010.1358 (2010)

Original

2010

Later among the works it cites.

M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Transactions on Information Theory

2011

Later among the works it cites.

R. Matsumoto, M. Hayashi, “Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages,” arXiv:1111.4174 (2011)

Original

2011

Later among the works it cites.

M. Hayashi, “Large deviation analysis for classical and quantum security via smoothing,” arXiv:1202.0322 (2012)

Original

2012

Closest in time.