Strongly leakage resilient authenticated key exchange, revisited

被引:12
作者
Yang, Guomin [2 ]
Chen, Rongmao [1 ]
Mu, Yi [2 ]
Susilo, Willy [2 ]
Guo, Fuchun [2 ]
Li, Jie [1 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Changsha, Hunan, Peoples R China
[2] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW, Australia
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Authenticated key exchange; Key leakage; Weak randomness; CRYPTOGRAPHY;
D O I
10.1007/s10623-019-00656-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Authenticated Key Exchange (AKE) protocols allow two (or multiple) parties to authenticate each other and agree on a common secret key, which is essential for establishing a secure communication channel over a public network. AKE protocols form a central component in many network security standards such as IPSec, TLS/SSL, and SSH. However, it has been demonstrated that many standardized AKE protocols are vulnerable to side-channel and key leakage attacks. In order to defend against such attacks, leakage resilient (LR-) AKE protocols have been proposed in the literature. Nevertheless, most of the existing LR-AKE protocols only focused on the resistance to long-term key leakage, while in reality leakage of ephemeral secret key (or randomness) can also occur due to various reasons such as the use of poor randomness sources or insecure pseudo-random number generators (PRNGs). In this paper, we revisit the strongly leakage resilient AKE protocol (CT-RSA'16) that aimed to resist challenge-dependent leakage on both long-term and ephemeral secret keys. We show that there is a security issue in the design of the protocol and propose an improved version that can fix the problem. In addition, we extend the protocol to a more general framework that can be efficiently instantiated under various assumptions, including hybrid instantiations that can resist key leakage attacks while preserving session key security against future quantum machines.
引用
收藏
页码:2885 / 2911
页数:27
相关论文
共 40 条
[1]  
Akavik A, 2009, LECT NOTES COMPUT SC, V5444, P474
[2]   Charm: a framework for rapidly prototyping cryptosystems [J].
Akinyele, Joseph A. ;
Garman, Christina ;
Miers, Ian ;
Pagano, Matthew W. ;
Rushanan, Michael ;
Green, Matthew ;
Rubin, Aviel D. .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) :111-128
[3]  
Alwen J, 2009, LECT NOTES COMPUT SC, V5677, P36, DOI 10.1007/978-3-642-03356-8_3
[4]  
[Anonymous], 2011, ASIACCS
[5]  
[Anonymous], 2014, ASIACCS
[6]  
[Anonymous], 2013, GOOGLE ADMITS ANDROI
[7]  
[Anonymous], CRYPTO BACKDOOR PITT
[8]  
[Anonymous], 97893 ISOIEC IS
[9]  
[Anonymous], IACR CRYPTOL EPRINT
[10]  
[Anonymous], 2011, RENEW ENERGY POWER Q, DOI DOI 10.24084/REPQJ09.355