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

Computers & Mathematics with Applications

An efficient dynamic authenticated key exchange protocol with selectable identities

Hua Guo, Zhoujun Li, Yi Mu, Fan Zhang, Chuan-Kun Wu, Jikai Teng

Published Apr 14, 2011• 2 citations
Publisher
DOI
10.1016/j.camwa.2011.02.041

Related papers

Efficient identity-based authenticated multiple key exchange protocol

Zuowen Tan

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

Certificateless and Identity based Authenticated Key Exchange Protocols

Saikrishna Badrinarayanan, Chandrasekharan Pandu Rangan

Communications in computer and information science•Jan 1, 2015•1 citation

An Efficient Two-Party Identity-Based Key Exchange Protocol

Yuh‐Min Tseng

A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.

Informatica•Jan 1, 2007•43 citations

An Efficient Attribute-Based Authenticated Key Exchange Protocol

Suvradip Chakraborty, Y. Sreenivasa Rao, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2018•3 citations

Authenticated Key Exchange with Synchronized States.

Zheng Yang

Abstract. Nowadays, most of sensitive applications over insecure network are protected by some authenticated secure channel which is highly relies on specific authenticated key exchange (AKE) protocol. Nevertheless, the leakage of authentication credential used in AKE protocol somehow result in unauthorized exploitation of credential information via identity impersonation (IDI) attack. To address the problem of IDI, we introduce a new dynamic authentication factor for AKE protocols, i.e., the secret execution states, to either prevent IDI attack by detecting attempts thereof, or limit its consequences by on-line detecting situations of previously unidentified IDI. In this paper, we model the security for authenticated key exchange with synchronized states (AKESS) based on Bellare-Rogaway model, and we particularly formalize the IDI and IDI detection. We propose a generic execution states synchronization framework for AKE, in which we utilize the session key to generate the secret execution states on both sides, and present a new AKESS protocol which is provably secure in the standard model. Our goal is to enhance the security of existing authenticated key exchange with long-lived key (AKELL) protocols by equipping them with the capabilities of both IDI prevention and detection without modifications on those protocols.

•Jan 1, 2011•0 citations

An Efficient Leakage-Resilient Authenticated Key Exchange Protocol

SeongHan Shin, Kazukuni Kobara, Hideki Imai

IEEE International Symposium on Information Theory (ISIT)•Dec 14, 2004•0 citations
A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.
Abstract. Nowadays, most of sensitive applications over insecure network are protected by some authenticated secure channel which is highly relies on specific authenticated key exchange (AKE) protocol. Nevertheless, the leakage of authentication credential used in AKE protocol somehow result in unauthorized exploitation of credential information via identity impersonation (IDI) attack. To address the problem of IDI, we introduce a new dynamic authentication factor for AKE protocols, i.e., the secret execution states, to either prevent IDI attack by detecting attempts thereof, or limit its consequences by on-line detecting situations of previously unidentified IDI. In this paper, we model the security for authenticated key exchange with synchronized states (AKESS) based on Bellare-Rogaway model, and we particularly formalize the IDI and IDI detection. We propose a generic execution states synchronization framework for AKE, in which we utilize the session key to generate the secret execution states on both sides, and present a new AKESS protocol which is provably secure in the standard model. Our goal is to enhance the security of existing authenticated key exchange with long-lived key (AKELL) protocols by equipping them with the capabilities of both IDI prevention and detection without modifications on those protocols.