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

China Communications

Authenticated Key Agreement Protocol

Massoud, Hadian, Dehkordi, Reza, Alimoradi

Published Jan 1, 2010• 2 citations
OpenAlex

Related papers

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 New Authenticated Key Agreement Protocol.

Kee-Won Kim, Eun‐Kyung Ryu, Hyung-Mok Lee +1 more

Computer Applications in Industry and Engineering•Jan 1, 2003•0 citations

Authenticated certificateless key agreement protocol

Xinyin Xiang

Journal of Computer Applications•Feb 26, 2009•1 citation

A new certificateless authenticated two-party key agreement

YuXiu-Ying, ZhangWen-Fang, HeDa-Ke

Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.

IEEE International Conference on Computer Science and Automation Engineering•Jun 1, 2011•0 citations

An Enhancement of Authenticated Key Agreement Protocol

L. Seung-Yeon, Yu-Nam Kim, Huh E.N

Proceedings of the Korean Information Science Society Conference•Jan 1, 2005•0 citations

An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Gang Yao, Hongji Wang, Qingshan Jiang

Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•12 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.
Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.
Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.