Hybrid Key Encapsulation Mechanisms and Authenticated Key Exchange

被引:43
作者
Bindel, Nina [1 ]
Brendel, Jacqueline [1 ]
Fischlin, Marc [1 ]
Goncalves, Brian [2 ]
Stebila, Douglas [3 ]
机构
[1] Tech Univ Darmstadt, Darmstadt, Germany
[2] Ryerson Univ, Toronto, ON, Canada
[3] Univ Waterloo, Waterloo, ON, Canada
来源
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2019 | 2019年 / 11505卷
基金
加拿大自然科学与工程研究理事会;
关键词
Key exchange; Hybrid key exchange; Combiners; KEMs; SECURITY;
D O I
10.1007/978-3-030-25510-7_12
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Concerns about the impact of quantum computers on currently deployed public key cryptography have instigated research into not only quantum-resistant cryptographic primitives but also how to transition applications from classical to quantum-resistant solutions. One approach to mitigate the risk of quantum attacks and to preserve common security guarantees are hybrid schemes, which combine classically secure and quantum-resistant schemes. Various academic and industry experiments and draft standards related to the Transport Layer Security (TLS) protocol already use some form of hybrid key exchange; however sound theoretical approaches to substantiate the design and security of such hybrid key exchange protocols are missing so far. We initiate the modeling of hybrid authenticated key exchange protocols, considering security against adversaries with varying levels of quantum power over time, such as adversaries who may become quantum in the future or are quantum in the present. We reach our goal using a three-step approach: First, we introduce security notions for key encapsulation mechanisms (KEMs) that enable a fine-grained distinction between different quantum scenarios. Second, we propose several combiners for constructing hybrid KEMs that correspond closely to recently proposed Internet-Drafts for hybrid key exchange in TLS 1.3. Finally, we present a provably sound design for hybrid key exchange using KEMs as building blocks.
引用
收藏
页码:206 / 226
页数:21
相关论文
共 42 条
[1]   Unforgeable Quantum Encryption [J].
Alagic, Gorjan ;
Gagliardoni, Tommaso ;
Majenz, Christian .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT III, 2018, 10822 :489-519
[2]   Estimate All the {LWE, NTRU} Schemes! [J].
Albrecht, Martin R. ;
Curtis, Benjamin R. ;
Deo, Amit ;
Davidson, Alex ;
Player, Rachel ;
Postlethwaite, Eamonn W. ;
Virdia, Fernando ;
Wunderer, Thomas .
SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2018, 2018, 11035 :351-367
[3]  
Alkim E, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P327
[4]  
Bellare M., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P419, DOI 10.1145/276698.276854
[5]  
Bellare M., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P1
[6]  
Bellare M., 2015, 20151198 CRYPT EPR A
[7]  
Bellare M., 1993, P ANN INT CRYPT C, P232, DOI DOI 10.1007/3-540-48329-2_21
[8]  
Bellare M., 2004, 2004309 CRYPT EPR AR
[9]  
Bellare M, 2006, LECT NOTES COMPUT SC, V4117, P602
[10]   Strengths and weaknesses of quantum computing [J].
Bennett, CH ;
Bernstein, E ;
Brassard, G ;
Vazirani, U .
SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1510-1523