Security and Communication Networks

A strongly secure identity-based authenticated key agreement protocol without pairings under the GDH assumption

Haiyan Sun, Qiaoyan Wen, Hua Zhang, Zhengping Jin

Published Mar 23, 2015• 19 citations

Abstract

Among the existing identity-based authenticated key agreement ID-AKA protocols, there are only a few of them that can resist to leakage of ephemeral secret keys, which is about the protection of the session secret key after the ephemeral secret keys of users are compromised. However, all these ID-AKA protocols with leakage of ephemeral secret keys resistance require expensive bilinear pairing operations. In this paper, we present a pairing-free ID-AKA protocol with ephemeral secrets leakage resistance. We also provide a full proof of its security in the extended Canetti-Krawczyk model, which not only can capture resistance to leakage of ephemeral secret keys but also can capture other basic security properties such as master key forward security and key compromise impersonation resistance. Compared with the existing ID-AKA protocols, our scheme is a good trade-off between security and efficiency. Copyright © 2015 John Wiley & Sons, Ltd.

DOI: 10.1002/sec.1241

Related papers

Identity-Based One Round Key Agreement Protocol without Bilinear Pairings

Wenhao Liu, Shengbao Wang, Xiao Tan +2 more

Almost all the existing identity-based key agreement (ID-KA) protocols cannot achieve both ephemeral secret reveal resilience and pairing-free. In this paper, a pairing-free ID-KA protocol is proposed, which captures all basic desirable security properties including key generation center forward secrecy, key compromise impersonation resilience and ephemeral secrets reveal resistance. On the other hand, the proposed scheme only needs one round communication between the two parties. Compared with the previous ID-KA protocols, the proposed scheme is more secure and efficient.

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)Nov 1, 20152 citations

Security-provable Identity-based Authenticated Key Agreement Protocol

Yafei Wang

Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.

Jisuanji gongchengJan 1, 20120 citations

Efficient Leakage-Resilient Authenticated Key Agreement Protocol in the Continual Leakage eCK Model

Jui‐Di Wu, Yuh‐Min Tseng, Sen‐Shan Huang

Based on users’ permanent private keys and ephemeral secret keys (randomness secret values), authenticated key agreement (AKA) protocols are used to construct a common session key between two session parties while authenticating each other. Recently, the design of leakage-resilient AKA (LR-AKA) resisting side-channel attacks has received significant attention from researchers. By side-channel attacks, an adversary is allowed to obtain fractional leakage information of private (secret) keys during the computation rounds of LR-AKA protocols. However, most LR-AKA protocols have a restriction, namely, the overall fractional leakage information must be bounded. In this paper, we propose an efficient LR-AKA protocol with overall unbounded leakage property in the continual leakage extended Canetti-Krawczyk model. Security analysis is given to demonstrate that our LR-AKA protocol is provably secure in the generic bilinear group model. By comparisons, our protocol is better than the previously proposed LR-AKA protocols in terms of computation cost, security model, and leakage properties.

IEEE AccessJan 1, 201819 citations

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer ApplicationsJan 1, 20120 citations

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)Jul 1, 20114 citations

Extended identity-based authenticated key agreement in standard model

Min Chen

The existing identity-based authenticated key agreement(ID-AKA) protocols in standard model either had known security flaws or could be verified security in weak security models.This paper proposed an extended ID-AKA protocol,which fully considered the security needs for leaking the long-term private keys,the session temporary secrets and the PKG master key.It further defined two types of fresh oracle and a session-state query,based on the ID-BJM security model,in which simulated secure games of key-compromise impersonation and perfect forward secrecy respectively.The new protocol was proven to meet the strong security with the improved ID-BJM model.The comparative analysis shows that the new protocol not only has high security,but lower computational costs.And the extended ID-AKA protocol can be used to build secure point to point communication channel on the application scenarios without key escrow.

Jisuanji yingyong yanjiuJan 1, 20140 citations