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

CRC Press eBooks

New secure explicitly authenticated key agreement protocols

Y. Abouelseoud & M. Nabil

Published Apr 7, 2014• 0 citations
Publisher
DOI
10.1201/b16763-41

Related papers

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

A New Security Model for Authenticated Key Agreement

Augustin P. Sarr, Philippe Elbaz–Vincent, Jean-Claude Bajard

Lecture notes in computer science•Jan 1, 2010•82 citations

An efficient protocol for two‐party explicit authenticated key agreement

Minghui Zheng, Huihua Zhou, Jing Chen

Summary Successful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

Concurrency and Computation Practice and Experience•Dec 26, 2013•11 citations

Strongly secure identity-based authenticated key agreement protocols

Liang Ni, Gongliang Chen, Jianhua Li +1 more

Computers & Electrical Engineering•Mar 1, 2011•40 citations

Improved two-party authenticated key agreement protocol

Zhang Long-xiang

Journal of Computer Applications•May 27, 2013•0 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
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.
Summary Successful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.
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.