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

Advances in intelligent systems and computing

A Novel Secure Two-Party Identity-Based Authenticated Key Agreement Protocol Without Bilinear Pairings

Seyed Mohsen Ghoreishi, Ismail Fauzi Isnin, Shukor Bin Abd Razak, Hassan Chizari

Published Jan 1, 2015• 6 citations
Publisher
DOI
10.1007/978-3-319-17398-6_26

Related papers

A Secure Identity-Based Three-Party Authenticated Key Agreement Protocol Using Bilinear Pairings

Daya Sagar Gupta, S K Hafizul Islam, Mohammad S. Obaidat

Lecture notes on data engineering and communications technologies•Jan 1, 2020•9 citations

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

Liang Ni, Gongliang Chen, Jianhua Li +1 more

Information Sciences•May 18, 2016•29 citations

An improved two-party identity-based authenticated key agreement protocol using pairings

Marko Hölbl, Tatjana Welzer, Boštjan Brumen

Journal of Computer and System Sciences•Jan 23, 2011•51 citations

Secure and Efficient Two-Party Identity-based Authenticated Key Agreement Protocol

Shuai Shao, Guoai Xu, Xinxin Niu

International Journal of Advancements in Computing Technology•Jul 31, 2013•0 citations

A Two-Party Identity-Based Key Agreement Protocol with Explicit Authentication

Haomin Yang, Yaoxue Zhang, Yuezhi Zhou

A two-message two-party key agreement protocol with explicit authentication provides perfect forward secrecy. Digital signatures can usually be used as providing explicit authentication for a key agreement protocol. Shim proposed an efficient identity-based signature scheme using bilinear pairings; however, he did not give a formal security proof for it. In this paper, we present a formal security proof for Shim's signature scheme. Using Shim's signature scheme as building blocks, we propose a new two-party identity-based key agreement protocol with explicit authentication. The proposed protocol satisfies a set of desirable security properties. Compared with the related protocols, the proposed protocol has distinct advantages in terms of security and computational efficiency.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2012•0 citations

Pairing-Based Two-Party Authenticated Key Agreement Protocol.

Rongxing Lu, Zhenfu Cao, Renwang Su +1 more

Abstract. To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model. 1

•Jan 1, 2005•6 citations
A two-message two-party key agreement protocol with explicit authentication provides perfect forward secrecy. Digital signatures can usually be used as providing explicit authentication for a key agreement protocol. Shim proposed an efficient identity-based signature scheme using bilinear pairings; however, he did not give a formal security proof for it. In this paper, we present a formal security proof for Shim's signature scheme. Using Shim's signature scheme as building blocks, we propose a new two-party identity-based key agreement protocol with explicit authentication. The proposed protocol satisfies a set of desirable security properties. Compared with the related protocols, the proposed protocol has distinct advantages in terms of security and computational efficiency.