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

Network Working Group

V. Cakulev, Ganapathy S. Sundaram

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Cryptographic protocols based on public key methods are based on certificates and large scale public key infrastructure (PKI) to support certificate management. The emerging field of Identity Based Encryption protocols allows to simplify the infrastructure requirements via a Private-key Generator (PKG) while providing the same flexibility. However one significant limitation of Identity Based Encryption methods is that the PKG can end up being a de-facto key escrow server with undesirable consequences. Another observed deficiency is a lack of mutual authentication of communicating parties. Here, Identity Based Authenticated Key Exchange (IBAKE) Protocol is specified which does not suffer from the key escrow problem and in addition provides mutual authentication and a perfect forward and backwards secrecy. Status of this Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.

Related papers

An Identity Based Key Exchange Scheme with Perfect Forward Security

Sonalin Subhadarshini

Identity-based authenticated key exchange protocol(IBAKE) with perfect forward security(PFS) is one of the major advancement in the field of cryptography. This protocol is used to establish secure communication between two parties who are provided with their own unique identities, by establishing their common secret keys without the need of sending and verifying their public key certificates. This scheme involves a key generation centre(KGC) which would provide the two parties involved, with their static key that can be authenticated by the parties. Our protocol can be viewed as a variant of the protocol proposed by Xie et al. in 2012 [8]. Our protocol does not rely on bilinear pairings. We have made a comparative study of the existing protocol and the proposed protocol and proved that our protocol is more efficient. We have also provided enough proofs to verfy that our protocol is secure under attacks and is not forgeable.

•Jan 1, 2015•0 citations

Malicious Private-key Generator in Identity-based Authenticated-key Exchange

Kazuma Wariki, Atsushi Fujioka, Kazuki Yoneyama +3 more

This paper introduces two new security models for identity-based authenticated-key exchange (IBAKE): the id-neCK security model and the id-reCK security model. While most existing IBAKE models assume that the private-key generator (PKG) behaves honestly, the id-neCK model captures a malicious scenario in which an adversary can obtain the random string used by the PKG to generate the master public- and secret-keys. In contrast, the id-reCK model captures an attack in which an adversary can replace the master public- and secret-keys generated by an honest PKG. We prove that the id-reCK security notion is strictly stronger than both the id-neCK security notion and the existing id-eCK (identity-based extended Canetti-Krawczyk) security notion, which guarantees resistance against ephemeral private information leakage. Next, assuming the existence of a secure public-key cryptosystem, we show that there exists an IBAKE protocol that is id-eCK secure but not id-neCK secure. This implies that, under this assumption, the id-neCK security notion is strictly stronger than the id-eCK security notion. Finally, we discuss IBAKE protocols that satisfy these security notions.

Journal of Information Processing•Jan 1, 2026•0 citations

An Escrow-Free Two-party Identity-based Key Agreement Protocol without Using Pairings for Distinct PKGs

Thokozani Felix Vallent, Eun‐Jun Yoon, Hyunsung Kim

Key escrow is a default property that is inherent in identity-based cryptography, where a curious private key generator (PKG) can derive a secret value shared by communicating entities in its domain. Therefore, a dishonest PKG can encrypt and decrypt ciphers or can carry out any attack on the communicating parties. Of course, the escrow property is not completely unwanted but is acceptable in other particular applications. On the other hand, in more civil applications, this key escrow property is undesirable and needs to be removed to provide maximum communication privacy. Therefore, this paper presents an escrow-free identity-based key agreement protocol that is also applicable even in a distinct PKG condition that does not use pairings. The proposed protocol has comparable computational and communicational performance to many other protocols with similar security attributes, of which their security is based on costly bilinear pairings. The protocol’s notion was inspired by McCullagh et al. and Chen-Kudla, in regard to escrow-free and multi-PKG key agreement ideas. In particular, the scheme captures perfect forward secrecy and key compromise impersonation resilience, which were lacking in McCullagh et al.’s study, as well as all other desirable security attributes, such as known key secrecy, unknown key-share resilience and no-key control. The merit in the proposed protocol is the achievement of all required security requirements with a relatively lower computational overhead than many other protocols because it precludes pairings.

IEIE Transactions on Smart Processing and Computing•Jun 1, 2013•8 citations

A Secure ID-Based Explicit Authenticated Key Agreement Protocol without Key Escrow

Mengbo Hou, Qiuliang Xu

Key agreement protocols are essential for secure communications in open and distributed environments. Identity-based cryptography has become extremely fashionable in the last few years for its special advantages. In this paper, we point out some flaw in the scheme proposed by Wang et al., then we present a two-party identity-based explicit authenticated key agreement protocol with key confirmation, which was inspired on a new identity-based encryption scheme first proposed by Gentry and can be used properly in the escrowless mode. The scheme captures the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, perfect forward secrecy, and no-key control. Especially, the scheme captures the PKG forward secrecy property. The PKG still could not recover all the userspsila past session keys even he knows the long-term private keys of all users.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•1 citation

Efficient three-party authenticated key agreement protocol in certificateless cryptography

Hu Xiong, Zhong Chen, Zhiguang Qin

Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Key agreement can be achieved using a public key infrastructure or identity-based cryptography. However, the former suffers from a heavy certificate management burden, while the latter is subject to the so-called key escrow problem. Recently, the notion of certificateless public key cryptography (CL-PKC) was introduced to mitigate these limitations. In this paper, we introduce the notion of three-party authenticated key agreement into CL-PKC and propose a concrete certificateless three-party authenticated key agreement protocol. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.

International Journal of Computer Mathematics•Jun 13, 2011•2 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•12 citations
Cryptographic protocols based on public key methods are based on certificates and large scale public key infrastructure (PKI) to support certificate management. The emerging field of Identity Based Encryption protocols allows to simplify the infrastructure requirements via a Private-key Generator (PKG) while providing the same flexibility. However one significant limitation of Identity Based Encryption methods is that the PKG can end up being a de-facto key escrow server with undesirable consequences. Another observed deficiency is a lack of mutual authentication of communicating parties. Here, Identity Based Authenticated Key Exchange (IBAKE) Protocol is specified which does not suffer from the key escrow problem and in addition provides mutual authentication and a perfect forward and backwards secrecy. Status of this Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Identity-based authenticated key exchange protocol(IBAKE) with perfect forward security(PFS) is one of the major advancement in the field of cryptography. This protocol is used to establish secure communication between two parties who are provided with their own unique identities, by establishing their common secret keys without the need of sending and verifying their public key certificates. This scheme involves a key generation centre(KGC) which would provide the two parties involved, with their static key that can be authenticated by the parties. Our protocol can be viewed as a variant of the protocol proposed by Xie et al. in 2012 [8]. Our protocol does not rely on bilinear pairings. We have made a comparative study of the existing protocol and the proposed protocol and proved that our protocol is more efficient. We have also provided enough proofs to verfy that our protocol is secure under attacks and is not forgeable.
This paper introduces two new security models for identity-based authenticated-key exchange (IBAKE): the id-neCK security model and the id-reCK security model. While most existing IBAKE models assume that the private-key generator (PKG) behaves honestly, the id-neCK model captures a malicious scenario in which an adversary can obtain the random string used by the PKG to generate the master public- and secret-keys. In contrast, the id-reCK model captures an attack in which an adversary can replace the master public- and secret-keys generated by an honest PKG. We prove that the id-reCK security notion is strictly stronger than both the id-neCK security notion and the existing id-eCK (identity-based extended Canetti-Krawczyk) security notion, which guarantees resistance against ephemeral private information leakage. Next, assuming the existence of a secure public-key cryptosystem, we show that there exists an IBAKE protocol that is id-eCK secure but not id-neCK secure. This implies that, under this assumption, the id-neCK security notion is strictly stronger than the id-eCK security notion. Finally, we discuss IBAKE protocols that satisfy these security notions.
Key escrow is a default property that is inherent in identity-based cryptography, where a curious private key generator (PKG) can derive a secret value shared by communicating entities in its domain. Therefore, a dishonest PKG can encrypt and decrypt ciphers or can carry out any attack on the communicating parties. Of course, the escrow property is not completely unwanted but is acceptable in other particular applications. On the other hand, in more civil applications, this key escrow property is undesirable and needs to be removed to provide maximum communication privacy. Therefore, this paper presents an escrow-free identity-based key agreement protocol that is also applicable even in a distinct PKG condition that does not use pairings. The proposed protocol has comparable computational and communicational performance to many other protocols with similar security attributes, of which their security is based on costly bilinear pairings. The protocol’s notion was inspired by McCullagh et al. and Chen-Kudla, in regard to escrow-free and multi-PKG key agreement ideas. In particular, the scheme captures perfect forward secrecy and key compromise impersonation resilience, which were lacking in McCullagh et al.’s study, as well as all other desirable security attributes, such as known key secrecy, unknown key-share resilience and no-key control. The merit in the proposed protocol is the achievement of all required security requirements with a relatively lower computational overhead than many other protocols because it precludes pairings.
Key agreement protocols are essential for secure communications in open and distributed environments. Identity-based cryptography has become extremely fashionable in the last few years for its special advantages. In this paper, we point out some flaw in the scheme proposed by Wang et al., then we present a two-party identity-based explicit authenticated key agreement protocol with key confirmation, which was inspired on a new identity-based encryption scheme first proposed by Gentry and can be used properly in the escrowless mode. The scheme captures the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, perfect forward secrecy, and no-key control. Especially, the scheme captures the PKG forward secrecy property. The PKG still could not recover all the userspsila past session keys even he knows the long-term private keys of all users.
Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Key agreement can be achieved using a public key infrastructure or identity-based cryptography. However, the former suffers from a heavy certificate management burden, while the latter is subject to the so-called key escrow problem. Recently, the notion of certificateless public key cryptography (CL-PKC) was introduced to mitigate these limitations. In this paper, we introduce the notion of three-party authenticated key agreement into CL-PKC and propose a concrete certificateless three-party authenticated key agreement protocol. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.
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.