Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computer Engineering and Applications Journal

Provable secure authenticated key exchange protocol under standard model

LI Yi-fa

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

This paper presents an identity-based authenticated key exchange protocol in the standard model.Protocol design isinspired by bilinear pairings.Strand space knowledge and Game method in provable security are comprehensively used.Thecorrectness of the protocol is analysed and a strict proof is given.The protocol has good forward security and session keynon-hosting.At the same time,through the explicit authentication,it improves the efficiency of the implementation of the pro-tocol.Compared with the protocol in the random oracle model,the protocol has the same computational and communicationefficiencies.

Related papers

A provably secure authenticated key exchange protocol

Lijiang Zhang

Authenticated key exchange protocol not only allows parities to compute the shared session key but also ensures authenticity of the parties. In this work, we propose an authenticated key exchange protocol CMQV+ which is an improved version of the protocol CMQV. Furthermore, we show that our proposed scheme was provably secure with a tight security reduction under eCK model in random oracle model. Also, the proposed protocol is efficient.

Wireless Communications, Networking and Information Security•Jun 1, 2010•6 citations

A Secure ID-Based Authenticated Group Key Exchange Protocol Resistant to Insider Attacks.

Tsu‐Yang Wu, Yuh‐Min Tseng, Ching-Wen Yu

Recently, several identity (ID)-based authenticated group key exchange (IDAGKE) protocols from bilinear pairings were proposed. However, they all suffered from different types of insider (participants) colluding attacks. In this paper, we present a new IDAGKE protocol from bilinear pairings. In the random oracle model and under some security assumptions, we demonstrate that the proposed protocol is a provably secure IDAGKE protocol providing forward secrecy. Meanwhile, it is secure against insider attacks.

Journal of information science and engineering•Jan 1, 2011•18 citations

Provably Secure Identity-Based Authenticated Key Agreement Protocols in the Standard Model

Sheng Wang

This paper presents an identity-based key agreement protocols that are provably secure without random oracles(namely,in the standard model).It is inspired by a new identity-based encryption scheme first proposed by Gentry.This paper details how this key agreement can be used in either escrowed or escrowless mode.All the proposed protocols are compared performance(with respect to computational and communication efficiencies) to all known protocols that are only proven secure in the random oracle model.

Chinese Journal of Computers•Jan 1, 2007•18 citations

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 citations

Provably Secure Two-Party Explicit Authenticated Key Agreement Protocol

Minghui Zheng, Jing Chen

This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jun 1, 2012•0 citations

id-eCK Secure ID-Based Authenticated Key Exchange on Symmetric and Asymmetric Pairing

Atsushi Fujioka, Fumitaka Hoshino, Tetsutaro Kobayashi +3 more

In this paper, we propose an identity-based authenticated key exchange (ID-AKE) protocol that is secure in the identity-based extended Canetti-Krawczyk (id-eCK) model in the random oracle model under the gap Bilinear Diffie-Hellman assumption. The proposed ID-AKE protocol is the most efficient among the existing ID-AKE protocols that is id-eCK secure, and it can be extended to use in asymmetric pairing.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2013•8 citations
This paper presents an identity-based authenticated key exchange protocol in the standard model.Protocol design isinspired by bilinear pairings.Strand space knowledge and Game method in provable security are comprehensively used.Thecorrectness of the protocol is analysed and a strict proof is given.The protocol has good forward security and session keynon-hosting.At the same time,through the explicit authentication,it improves the efficiency of the implementation of the pro-tocol.Compared with the protocol in the random oracle model,the protocol has the same computational and communicationefficiencies.
Recently, several identity (ID)-based authenticated group key exchange (IDAGKE) protocols from bilinear pairings were proposed. However, they all suffered from different types of insider (participants) colluding attacks. In this paper, we present a new IDAGKE protocol from bilinear pairings. In the random oracle model and under some security assumptions, we demonstrate that the proposed protocol is a provably secure IDAGKE protocol providing forward secrecy. Meanwhile, it is secure against insider attacks.
This paper presents an identity-based key agreement protocols that are provably secure without random oracles(namely,in the standard model).It is inspired by a new identity-based encryption scheme first proposed by Gentry.This paper details how this key agreement can be used in either escrowed or escrowless mode.All the proposed protocols are compared performance(with respect to computational and communication efficiencies) to all known protocols that are only proven secure in the random oracle model.
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.