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

Lecture notes in computer science

A new identity-based key exchange protocol minimizing computation and communication

Shahrokh Saeednia, Reihaneh Safavi–Naini

Published Jan 1, 1998• 8 citations
Publisher
DOI
10.1007/bfb0030433

Related papers

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Xuefei Cao, Weidong Kou, Xiaoni Du

Information Sciences•Apr 22, 2010•252 citations

Cryptanalysis of an identity‐based authenticated key exchange protocol

Younes Hatri, Ayoub Otmani, Kenza Guenda

Summary Authenticated key exchange protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu, and Susilo proposed an identity‐based authenticated key exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities.The authors also introduced a new security notion for IBAKE protocols called resiliency, that is, if the secret shared key is compromised, the entities can generate another shared secret key without establishing a new session between them. They then claimed that their IBAKE protocol satisfies this security notion. We analyze the security of their protocol and prove that it has a major security flaw, which renders it insecure against an impersonation attack. We also disprove the resiliency property of their scheme by proposing an attack where an adversary can compute any shared secret key if just one secret bit is leaked.

arXiv:1611.07299•International Journal of Communication Systems•Dec 11, 2017•11 citations

An improved identity-based key agreement protocol and its security proof

S WANG, Zhenfu Cao, Kim‐Kwang Raymond Choo +1 more

Information Sciences•Oct 5, 2008•58 citations

Efficient identity-based authenticated multiple key exchange protocol

Zuowen Tan

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

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

Identity-Based Key Exchange Protocols without Pairings

Dario Fiore, Rosario Gennaro

Transactions on computational science•Jan 1, 2010•10 citations
Summary Authenticated key exchange protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu, and Susilo proposed an identity‐based authenticated key exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities.The authors also introduced a new security notion for IBAKE protocols called resiliency, that is, if the secret shared key is compromised, the entities can generate another shared secret key without establishing a new session between them. They then claimed that their IBAKE protocol satisfies this security notion. We analyze the security of their protocol and prove that it has a major security flaw, which renders it insecure against an impersonation attack. We also disprove the resiliency property of their scheme by proposing an attack where an adversary can compute any shared secret key if just one secret bit is leaked.
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.