Fetching the paper…
Reading the bibliography…
Recently, $\varepsilon$-almost dual universal$_2$ hash functions has been proposed as a new and wider class of hash functions.
A. I. Khinchin, Mathematical Foundations of Information Theory
1956
Earlier work this paper cites.
V. Strassen, “Asymptotische Abschätzugen in Shannon’s Informationstheorie,” In Transactions of the Third Prague Conference on Information Theory etc
1962
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.
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. System Sci
1979
Earlier work this paper cites.
M. N. Wegman and J. L. Carter, “New Hash Functions and Their Use in Authentication and Set Inequality,” J. Comput. System Sci
1981
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.
Y. Mansour, N. Nisan, and P. Tiwari, “The Computational Complexity of Universal Hashing,” in STOC ’90, Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp.235-243 (1990)
1990
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.
T. S. Han and S. Verdu, “Approximation theory of output statistics,” IEEE Trans. Inform. Theory
1993
Earlier work this paper cites.
U. Maurer, “The strong secret key rate of discrete random triples,” Communications and Cryptography - Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271-285, 1994
1994
Earlier work this paper cites.
S.Verdu and T. S. Han, “A general formula for channel capacity,” IEEE Trans. Inform. Theory
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. Verdu, “Generating random bits from an arbitrary source: fundamental limits,” IEEE Trans. Inform. Theory
1995
Earlier work this paper cites.
G. H. Golub, and C. F. Van Loan, Matrix Computation
1996
Earlier work this paper cites.
I. Csiszár, “Almost Independence and Secrecy Capacity,” Problems of Information Transmission
1996
Earlier work this paper cites.
I. Kontoyiannis, “Second-order noiseless source coding theorems,” IEEE Trans. Inform. Theory
1997
Earlier work this paper cites.
T. S. Han: Information-Spectrum Methods in Information Theory
1998
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
1999
Earlier work this paper cites.
T.S. Han, “The reliability functions of the general source with fixed-length coding,” IEEE Trans. Inform. Theory
2000
Earlier work this paper cites.
I. Csiszár, and P. Narayan, “Common randomness and secret key generation with a helper,” IEEE Trans. Inform. Theory
2000
Cited alongside, same era.
T.-S. Han and O. Uchida, “Source code with cost as a nonuniform random number generator,” IEEE Trans. Inform. Theory
2000
Cited alongside, same era.
L.P. Kuptsov, “Holder inequality”, in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Springer, (2001)
2001
Cited alongside, same era.
U. Maurer, S. Wolf, “Secret-key agreement over unauthenticated public channels - part I: definitions and a completeness result,” IEEE Trans. Inform. Theory
2003
Cited alongside, same era.
M. Hayashi, M. Koashi, K. Matsumoto, F. Morikoshi, and A. Winter, “Error exponents for entanglement concentration,” Journal of Physics A: Mathematical and General
2003
Cited alongside, same era.
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inform. Theory
2011
Later among the works it cites.
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover Hashing Against Quantum Side Information,” IEEE Trans. Inform. Theory
2011
Later among the works it cites.
X. Zhou, A. Kuijperl, R. Veldhuis, and C. Busch, “Quantifying Privacy and Security of Biometric Fuzzy Commitment,” Proceedings of 2011 International Joint Conference on Biometrics (IJCB)
2011
Later among the works it cites.
M. Bloch, and J. Barros, Physical-Layer Security: From Information Theory to Security Engineering
2011
Later among the works it cites.
A. J. Pierrot, and M. R. Bloch, “Strongly Secure Communications Over the Two-Way Wiretap Channel,” IEEE Transactions on Information Forensics and Security
2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Csiszár, and P. Narayan, “Secrecy capacities for multiple terminals,” IEEE Trans. Inform. Theory
2004
Cited alongside, same era.
S. Dziembowski, U. Maurer, “On generating the initial key in the bounded-storage model,” EUROCRYPT 2004, LNCS 3027, pp. 126-137, Springer, 2004
2004
Cited alongside, same era.
Y. Dodis and A. Smith. “Correcting Errors Without Leaking Partial Information,” STOC 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.
R. Renner, and R. König, ”Universally composable privacy amplification against quantum adversaries,” Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, J.Kilian (ed.) Springer Verlag 2005, vol. 3378 of Lecture Notes in Computer Science, pp. 407-425
2005
Cited alongside, same era.
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.
S. Fehr and C. Schaffner. “Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker,” Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. pages, 465-48
2008
Cited alongside, same era.
Later among the works it cites.
H. Tyagi, P. Narayan, and P. Gupta “When is a Function Securely Computable?,” IEEE Trans. Inform. Theory
2011
Later among the works it cites.
J. Shikata, “Formalization of Information-Theoretic Security for Encryption and Key Agreement, Revisited,” in Proceedings of the 2013 IEEE International Symposium on Information Theory
2012
Later among the works it cites.
M. Bellare, S. Tessaro, and A. Vardy, “Semantic Security for the Wiretap Channel,” LNCS Volume 7417, 2012, pp 294-311. CRYPTO 2012
2012
Later among the works it cites.
S. Nitinawarat and P. Narayan, “Secret key generation for correlated Gaussian sources,” IEEE Trans. Inform. Theory
2012
Later among the works it cites.
M. Hayashi, “Tight exponential analysis of universally composable privacy amplification and its applications,” IEEE Trans. Inform. Theory
2013
Closest in time.
T. Tsurumaru, and M. Hayashi, “Dual universality of hash functions and its applications to quantum cryptography,” IEEE Trans. Inform. Theory
2013
Closest in time.
2013
Closest in time.
S. Watanabe and M. Hayashi, “Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy,” Proceedings of the 2013 IEEE International Symposium on Information Theory
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
C. Ling, L. Luzzi, and M. R. Bloch “Secret key generation from Gaussian sources using lattice hashing,” Proceedings of the 2013 IEEE International Symposium on Information Theory
2013
Closest in time.
M. Iwamoto and J. Shikata, “Information Theoretic Security for Encryption Based on Conditional Renyi Entropies,” http://eprint.iacr.org/2013/440 (2013)
2013
Closest in time.
M. Muller-Lennert, F. Dupuis, O. Szehr, S. Fehr, and M. Tomamichel, “On quantum Renyi entropies: a new definition and some properties,” J. Math. Phys
2013
Closest in time.
2013
Closest in time.
M. Hayashi, “Large deviation analysis for quantum security via smoothing of Rényi entropy of order 2,” IEEE Trans. Inform. Theory
2014
Closest in time.