Authentication of variable length messages in quantum key distribution

EPJ Quantum Technology

Khodakhast Bibak¹  Venkatesh Srinivasan²  Bruce M. Kapron² 

[1] Department of Computer Science and Software Engineering, Miami University, 45056, Oxford, Ohio, USA;Department of Computer Science, University of Victoria, V8W 3P6, Victoria, BC, Canada;

关键词: Quantum key distribution;    Polynomial Hash;    ε;    Polynomial congruence;   

DOI  :  10.1140/epjqt/s40507-022-00127-0

来源: Springer

【 摘 要 】

Authentication plays a critical role in the security of quantum key distribution (QKD) protocols. We propose using Polynomial Hash and its variants for authentication of variable length messages in QKD protocols. Since universal hashing is used not only for authentication in QKD but also in other steps in QKD like error correction and privacy amplification, and also in several other areas of quantum cryptography, Polynomial Hash and its variants as the most efficient universal hash function families can be used in these important steps and areas, as well. We introduce and analyze several efficient variants of Polynomial Hash and, using deep results from number theory, prove that each variant gives an ε-almost-Δ-universal family of hash functions. We also give a general method for transforming any such family to an ε-almost-strongly universal family of hash functions. The latter families can then, among other applications, be used in the Wegman–Carter MAC construction which has been shown to provide a universally composable authentication method in QKD protocols. As Polynomial Hash has found many applications, our constructions and results are potentially of interest in various areas.

【 授权许可】

CC BY