EVERLASTING SECURITY OF QUANTUM KEY DISTRIBUTION WITH 1K-DWCDM AND QUADRATIC HASH

被引:9
作者
Bibak, Khodakhast [1 ]
Ritchie, Robert [1 ]
Zolfaghari, Behrouz [2 ,3 ]
机构
[1] Miami Univ, Dept Comp Sci & Software Engn, Oxford, OH 45056 USA
[2] Indian Inst Technol Guwahati, CSE Dept, Gauhati 781039, India
[3] Univ Guelph, Sch Comp Sci, Cyber Sci Lab, Guelph, ON N1G 2W1, Canada
关键词
Quantum key distribution; Everlasting security; 1K-DWCDM; Universal hashing; Quadratic congruence; MESSAGE-AUTHENTICATION; UNIVERSAL CLASSES; CONSTANT-TIME; INFORMATION; MODE;
D O I
10.26421/QIC21.3-4-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of epsilon-almost-Delta-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an epsilon-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.
引用
收藏
页码:181 / 202
页数:22
相关论文
共 65 条
[1]   Using quantum key distribution for cryptographic purposes: A survey [J].
Alleaume, R. ;
Branciard, C. ;
Bouda, J. ;
Debuisschert, T. ;
Dianati, M. ;
Gisin, N. ;
Godfrey, M. ;
Grangier, P. ;
Laenger, T. ;
Luetkenhaus, N. ;
Monyk, C. ;
Painchault, P. ;
Peev, M. ;
Poppe, A. ;
Pornin, T. ;
Rarity, J. ;
Renner, R. ;
Ribordy, G. ;
Riguidel, M. ;
Salvail, L. ;
Shields, A. ;
Weinfurter, H. ;
Zeilinger, A. .
THEORETICAL COMPUTER SCIENCE, 2014, 560 :62-81
[2]  
Bellare M., 1996, LECT NOTES COMPUTER, P115
[3]   Quantum cryptography: Public key distribution and coin tossing [J].
Bennett, Charles H. ;
Brassard, Gilles .
THEORETICAL COMPUTER SCIENCE, 2014, 560 :7-11
[4]  
Bernstein DJ, 2005, LECT NOTES COMPUT SC, V3557, P32
[5]  
Bierbrauer J., 1993, LECT NOTES COMPUTER, V5665, P331
[6]  
Black J., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P216, DOI 10.1007/3-540-48405-1_14
[7]  
Black J, 2002, LECT NOTES COMPUT SC, V2332, P384
[8]  
Black J, 2000, LECT NOTES COMPUT SC, V1880, P197
[9]  
Boneh D., 2020, A Graduate Course in Applied Cryptography, Version 0.5
[10]  
Brassard Gilles, 1982, ADV CRYPTOLOGY, P79