Group Key Establishment in a Quantum-Future Scenario

被引:5
作者
Gonzalez Vasco, Maria Isabel [1 ]
Perez del Pozo, Angel L. [1 ]
Steinwandt, Rainer [2 ]
机构
[1] Univ Rey Juan Carlos, MACIMTE, Madrid, Spain
[2] Florida Atlantic Univ, Dept Math Sci, Boca Raton, FL 33431 USA
关键词
Group Key Exchange; post-quantum cryptography; QUANTUM-future cryptography; EXCHANGE; SECURE;
D O I
10.15388/20-INFOR427
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In cryptography, key establishment protocols are often the starting point paving the way towards secure execution of different tasks. Namely, the parties seeking to achieve some cryptographic task, often start by establishing a common high-entropy secret that will eventually be used to secure their communication. In this paper, we put forward a security model for group key establishment (GAKE) with an adversary that may execute efficient quantum algorithms, yet only once the execution of the protocol has concluded. This captures a situation in which keys are to be established in the present, while security guarantees must still be provided in the future when quantum resources may be accessible to a potential adversary. Further, we propose a protocol design that can be proven secure in this model. Our proposal uses password authentication and builds upon efficient and reasonably well understood primitives: a message authentication code and a post-quantum key encapsulation mechanism. The hybrid structure dodges potential efficiency downsides, like large signatures, of some "true" post-quantum authentication techniques, making our protocol a potentially interesting fit for current applications with long-term security needs.
引用
收藏
页码:751 / 768
页数:18
相关论文
共 28 条
[1]  
Abdalla M, 2007, LECT NOTES COMPUT SC, V4392, P499
[2]  
Alkim E, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P327
[3]  
[Anonymous], 2001, ACM CCS 01 NOV, DOI DOI 10.1145/634067.6342922
[4]   Constant-Round Group Key Exchange from the Ring-LWE Assumption [J].
Apon, Daniel ;
Dachman-Soled, Dana ;
Gong, Huijing ;
Katz, Jonathan .
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2019, 2019, 11505 :189-205
[5]  
Aragon N, 2017, BIKE BIT FLIPPING KE
[6]  
Azarderakhsh R., 2017, SIKE SUPERSINGULAR I
[7]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1807, P139
[8]   Hash Proof Systems over Lattices Revisited [J].
Benhamouda, Fabrice ;
Blazy, Olivier ;
Ducas, Leo ;
Quach, Willy .
PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT II, 2018, 10770 :644-674
[9]  
Bernstein D., 2017, Classic mceliece
[10]   NTRU Prime: Reducing Attack Surface at Low Cost [J].
Bernstein, Daniel J. ;
Chuengsatiansup, Chitchanok ;
Lange, Tanja ;
van Vredendaal, Christine .
SELECTED AREAS IN CRYPTOGRAPHY - SAC 2017, 2018, 10719 :235-260