期刊
INFORMATION SCIENCES
卷 367, 期 -, 页码 176-193出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2016.05.015
关键词
Authenticated key agreement; Identity-based cryptography; Provable security; Diffie-Hellman assumption; The extended Canetti-Krawczyk model
资金
- National Natural Science Foundation of China [61171173]
- National Basic Research Program of China [2010CB731403, 2010CB731406]
- fund of the Information Content Security Management Innovation Base of China [TS0010303001]
- fund of the Information Content Analysis National Engineering Laboratory of China [GT036001]
- Henan Province Science and Technology Department Research Project [132102310284, 132102210186]
- Henan Province Education Department Research Project [14A520035, 14A520015, 2011A520050]
- Zhengzhou City Science and Technology Project [2010GYXM421, 131PPTGG416-4]
- fund of Zhengzhou City Science and Technology Innovation Team [131PCXTD600]
- National Natural Science Foundation Cultivation Project of Zhongyuan University of Technology [21000798]
- NSFC-Henan United Foundation [U160411223, U1504614]
In this paper, we present two strongly secure pairing-free identity-based (ID-based) twoparty authenticated key agreement (AKA) protocols achieving implicit authentication, which are proven secure in the extended Canetti-Krawczyk (eCK) model. The proposals can offer provable security against both passive and active adversaries in the random oracle model. Our schemes capture all basic desirable security properties including key compromise impersonation resilience, ephemeral secrets reveal resistance, (weak) perfect forward secrecy and master key forward secrecy etc. We show the security of one of these proposals can be reduced to the standard computational Diffie-Hellman assumption, and the security of the other relies on the gap Diffie-Hellman assumption while having a lower computational overhead. Currently, there are few pairing-free ID-based AKA protocols that are provably secure in such strong security models as the eCK model. Our schemes can provide strong security assurances and in the meanwhile achieve a good computational efficiency. Compared with previous related schemes, our protocols have advantages over them in security, efficiency or both. (C) 2016 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据