Fetching the paper…
Reading the bibliography…
Motivated by the desirability of universal composability, we analyze in terms of L_1 distinguishability the task of secret key generation from a joint random variable.
V. Strassen, “Asymptotische Abschätzugen in Shannon’s Informationstheorie,” In Transactions of the Third Prague Conference on Information Theory etc, Czechoslovak Academy of Sciences, Prague, pp. 689-723, 1962
1962
Earlier work this paper cites.
C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, “Lower bounds to error probability for coding in discrete memoryless channels. I,” Information and Control, vol. 10, pp. 65-103, 1967
1967
Earlier work this paper cites.
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.
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, “Broadcast channels with confidential messages,” IEEE Trans. Inform. Theory
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.
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.
U. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inform. Theory
1993
Earlier work this paper cites.
H. Krawczyk, “LFSR-based hashing and authentication,” Advances in Cryptology — CRYPTO ’94
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.
S. Vembu and S. Verdú, “Generating random bits from an arbitrary source: fundamental limits,” IEEE Trans. Inform. Theory
1995
Earlier work this paper cites.
I. Csiszár, “Almost Independence and Secrecy Capacity,” Problems of Information Transmission
1996
Cited alongside, same era.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications
1997
Cited alongside, same era.
T. S. Han: Information-Spectrum Methods in Information Theory
1998
Cited alongside, same era.
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.
U. Maurer and S. Wolf, “Infromation-theoretic key agreement: From weak to strong secrecy for free,” Advances in Cryptology–EUROCRYPT 2000
2000
Cited alongside, same era.
T.S. Han, “The reliability functions of the general source with fixed-length coding,” IEEE Trans. Inform. Theory
J. Muramatsu, “Secret key agreement from correlated source outputs using low density parity check matrices,” IEICE Trans. Fundamentals
2006
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.
S. Watanabe, private communication, 2007. (This communication is written in [ 6 , Appendix III] )
2007
Later among the works it cites.
M. Hayashi, “Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness,” IEEE Trans. Inform. Theory
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
L.P. Kuptsov, “Holder inequality”, in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Springer, (2001)
2001
Cited alongside, same era.
M. Hayashi, “Exponents of quantum fixed-length pure state source coding,” Physical Review A
2002
Cited alongside, same era.
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.
R. Renner and S. Wolf, “Simple and Tight Bounds for Information Reconciliation and Privacy Amplification,” ASIACRYPT 2005
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.
2009
Later among the works it cites.
M. Hayashi, “Information Spectrum Approach to Second-Order Coding Rate in Channel Coding,” IEEE Trans. Inform. Theory
2009
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
Closest in time.
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inform. Theory
2011
Closest in time.
T. Holenstein and R. Renner, “On the randomness of independent experiments,” IEEE Trans. Inform. Theory
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
J. Muramatsu, S. Miyake, “Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices,” IEEE Trans. Inform. Theory
2012
Closest in time.