Strongly secure identity-based authenticated key agreement protocols without bilinear pairings

详细信息    查看全文

• 作者：Liang Ni ; ^a ; ^b ; ^{niliang402@126.com" class="auth_mail" title="E-mail the corresponding author} ; ^{niliang402@hotmail.com" class="auth_mail" title="E-mail the corresponding author} ; ^{1165060759@qq.com" class="auth_mail" title="E-mail the corresponding author} ; Gongliang Chen^b ; Jianhua Li^b ; Yanyan Hao^c
• 关键词：Authenticated key agreement ; Identity-based cryptography ; Provable security ; Diffie&ndash ; Hellman assumption ; The extended Canetti&ndash ; Krawczyk model
• 刊名：Information Sciences
• 出版年：2016
• 出版时间：1 November 2016
• 年：2016
• 卷：367-368
• 期：Complete
• 页码：176-193
• 全文大小：728 K

文摘

In this paper, we present two strongly secure pairing-free identity-based (ID-based) two-party 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.