Fetching the paper…
Reading the bibliography…
A usual code for quantum wiretap channel requires an auxiliary random variable subject to the perfect uniform distribution.
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
1978
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.
J. Körner and A. Sgarro, “Universally attainable error exponents for broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory , vol. 26, no. 6, pp. 670–679, Nov. 1980
1980
Earlier work this paper cites.
T. S. Han and S. Verdú, “Approximation theory of output statistics,” 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.
I. Csiszár, “Almost Independence and Secrecy Capacity,” Problems of Information Transmission
1996
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse and Stein’s lemma in quantum hypothesis testing,” IEEE Trans. Inform. Theory
2000
Earlier work this paper cites.
M. Hayashi, “Optimal sequence of POVMs in the sense of Stein’s lemma in quantum hypothesis,” J. Phys. A: Math. and Gen
2002
Earlier work this paper cites.
A. Winter, A. C. A. Nascimento, and H. Imai, “Commitment Capacity of Discrete Memoryless Channels,” Proc. 9th Cirencester Crypto and Coding Conf
2003
Cited alongside, same era.
I. Devetak, “The private classical information capacity and quantum information capacity of a quantum channel,” IEEE Trans. Inform. Theory
2005
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.
I. Devetak, P. W. Shor, “The capacity of a quantum channel for simultaneous transmission of classical and quantum information,” Comm. Math. Phys
2005
Cited alongside, same era.
M. Hayashi, Quantum Information: An Introduction, Springer (2006)
2006
Cited alongside, same era.
M. Hayashi, “Information Spectrum Approach to Second-Order Coding Rate in Channel Coding,” IEEE Trans. Inform. Theory
2009
Later among the works it cites.
2010
Later among the works it cites.
Y. Polyanskiy, H.V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inform. Theory
2010
Later among the works it cites.
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inform. Theory
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
M. Hayashi, “Practical Evaluation of Security for Quantum Key Distribution,” Physical Review A
2006
Cited alongside, same era.
M. Hayashi, “Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding,” Physical Review A
2007
Cited alongside, same era.
M. Hayashi, “Upper bounds of eavesdropper’s performances in finite-length code with the decoy method,” Physical Review A
2009
Cited alongside, same era.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
S. Watanabe “Private and Quantum Capacities of More Capable and Less Noisy Quantum Channels,” Phys. Rev. A
2012
Closest in time.
T. Tsurumaru, M. Hayashi, “Dual universality of hash functions and its applications to quantum cryptography,” IEEE Trans. Inform. Theory
2013
Closest in time.