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

Journal of Computer Science and Technology

A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

Haibo Tian, Willy Susilo, Yang Ming, Yu-Min Wang

Published Sep 1, 2008• 5 citations
Publisher
DOI
10.1007/s11390-008-9178-z

Related papers

Provable Secure ID-Based Authenticated Key Agreement Protocol

Haiying Gao

Journal of Computer Research and Development•Aug 15, 2012•2 citations

A Provable Secure and Escrow-able Authenticated Group Key Agreement Protocol without NAXOS Trick

Shaheena Khatoon, Tejeshwari Thakur, Balwant Singh

We present an ID-based escrow-able authenticated group key agreement (AGKA) protocol which is provably secure in random oracle model.Additionally, the proposed protocol neither involve NAXOS trick nor uses gap assumption.And the security is proven in stronger eCK model.To our best knowledge, the proposed protocol will be first provable Secure and escrow-able ID based authenticated group key agreement protocol without NAXOS trick in eCK model.

International Journal of Computer Applications•Aug 17, 2017•1 citation

An Efficient ID-Based Authenticated Key Agreement Protocol with Pairings

Jai-Boo Oh, Eun‐Jun Yoon, Kee-Young Yoo

Lecture notes in computer science•Jan 1, 2007•15 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

An Efficient ID-Based Authenticated Key Agreement Protocol from Pairings

Eun‐Kyung Ryu, Eun‐Jun Yoon, Kee-Young Yoo

Lecture notes in computer science•Jan 1, 2004•46 citations

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for IIoT Environments

Daya Sagar Gupta, SK Hafizul Islam, Mohammad S. Obaidat +3 more

With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.

IEEE Systems Journal•Jul 3, 2020•85 citations
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.
With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.