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

Security and Communication Networks

Authenticated key exchange with entities from different settings and varied groups

Yanfei Guo, Zhenfeng Zhang

Published Aug 27, 2013• 0 citations
Publisher

Abstract

Abstract Authenticated key exchange (AKE) is a very important primitive in cryptography. In the last decades, many AKE protocols appeared either in the certificate‐based (cert‐based) setting or in the identity‐based (id‐based) setting. In real applications, entities from different settings may also have the requirement to communicate with each other. Several papers have concentrated on supporting either multiple certification authorities or multiple key generation centers, but very few have considered the interoperability between the two settings. Furthermore, existing approaches are still inadequate in supporting parameters from different algebraic groups. In this paper, we consider AKE protocols integrating cert‐based and id‐based settings with varied groups. Based on two extract algorithms for id‐based entities, we present two AKE protocols where one entity is cert‐based and the other is id‐based, and the parameters of both entities come from different groups. An extended AKE security model of Chatterjee et al. and Ustaoǧlu [1, 2] is proposed to support multiple certification authorities and multiple key generation centers in which the proposed protocols are proved to be secure. Other variant protocols are also presented. Then, extensions to support forward secrecy and resistance to leakage of both ephemeral keys are provided. Finally, we present a more efficient integrating protocol than existing constructions for users who use the same group. Copyright © 2013 John Wiley & Sons, Ltd.

DOI
10.1002/sec.868

Related papers

Hierarchical ID-Based Authenticated Key Exchange Resilient to Ephemeral Key Leakage

Atsushi Fujioka, Koutarou Suzuki, Kazuki Yoneyama

In this paper, the first extended Canetti-Krawzcyk (eCK) security model for hierarchical ID-based authenticated key exchange (AKE) that guarantee resistance to leakage of ephemeral secret keys is proposed. Moreover, an two-pass hierarchical ID-based AKE protocol secure in the proposed hierarchical ID-based eCK security model based on a hierarchical ID-based encryption is also proposed.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2011•2 citations

An Identity-Based Authenticated Key Exchange Protocol Resilient to Continuous Key Leakage

Jui‐Di Wu, Yuh‐Min Tseng, Sen‐Shan Huang

Identity-based authenticated key exchange (ID-AKE) protocol is an important cryptographic primitive, which is used to establish a session key between two communication participants while authenticating each other. Indeed, most of the existing ID-AKE protocols do not concern with side-channel attacks in the sense that adversaries could obtain partial information of ephemeral/permanent secret keys of users. Recently, several leakage-resilient ID-AKE (LR-ID-AKE) protocols have been proposed to address such attacks. However, these LR-ID-AKE protocols have a restriction that the total leakage information during the life time of the LR-ID-AKE protocol must be bounded to some ratio of ephemeral/permanent secret keys. In this paper, the authors define a new adversary model, termed as identity-based continuous-leakage extended Canetti-Krawczyk (ID-CL-eCK) model. Using the key refreshing procedure (i.e., the multiplicative blinding technique) of permanent secret keys, the first LR-ID-AKE protocol resilient to continuous key leakage is proposed, and it possesses overall unbounded leakage property. Comparisons are given to demonstrate that the proposed protocol is better than the previously proposed ID-AKE protocols in terms of security models and leakage properties. Under the generic bilinear group model, security analysis is made to show that the proposed LR-ID-AKE protocol is secure against adversaries in the new ID-CL-eCK model.

IEEE Systems Journal•Feb 18, 2019•30 citations

Authenticated key exchange protocol with selectable identities

Hua Guo, Yi Mu, Xiyong Zhang +1 more

Abstract In the traditional identity‐based cryptography, a user, who holds multiple identities, has to manage multiple private keys, where each private key is associated with an identity. In this paper, we present a key agreement protocol, which allows a single private key to map multiple public keys (identities) that are selectable by the user. That is, the established session key is associated with an arbitrary subset of identities held by the user, while the unselected identities remain secret to other participants. As a bonus, our scheme can be considered as a credential‐based key agreement, where the unique private key can be treated as a credential of the user and the user only proves that his credential is associated with some selected identities. We prove that our scheme is secure in the random oracle model. Copyright © 2010 John Wiley & Sons, Ltd.

Wireless Communications and Mobile Computing•Apr 15, 2010•3 citations

Tightly Secure ID-based Authenticated Key Exchange

Takumu Mita, Kazuki Yoneyama

In CRYPTO 2021, Han et al. proposed a PKI-based authenticated key exchange (AKE) scheme that satisfies tight security in the standard model by using KEM and digital signature with multi-user security as building blocks. On the other hand, no tightly secure ID-based AKE (ID-AKE) scheme is known. ID-AKE has the advantage that certificate management is unnecessary, and the authentication can be based on the party’s public ID, such as an e-mail address. In this paper, we propose the first tightly secure ID-AKE scheme in the standard model. First, we extend the security model of Han et al.’s PKI-based AKE to the security model for ID-AKE. Next, we introduce a generic construction with multi-user secure KEM and ID-based signature (IBS) as building blocks and prove the tight security in our security model. For instantiating the underlying IBS, we also revisit the security proof of the existing generic construction of tightly secure IBS proposed by Lee et al. We point out a problem in their proof and correct it by strengthening an assumption. As an instantiation of our scheme, a tightly secure ID-AKE scheme under the MDDH assumption can be realized in the standard model.

ACM ASIA Public-Key Cryptography Workshop (APKC)•Jun 28, 2024•0 citations

The design of authentication key protocol in certificate‐free public key cryptosystem

Yu‐Fang Chung

ABSTRACT In regard to the communication security of open networks, authenticated key management agreements are able to provide confidentiality, integrity, and verification so as to establish a more secure and fair digital rights management mechanism. For this reason, this paper, aiming at authentication key management agreements, tends to provide a security study on the application of authentication key management agreements, covering the establishment, analysis, design, security study, and performance optimization in various environments. Based on present public key schemes, such as public key cryptography, identity‐recognized cryptography, and undocumented cryptography, it aims to establish an authenticated key management agreement suitable for various application environments. Using the one‐way transmission in identity‐recognized cryptography or undocumented cryptography for formulating practical and effective security models, it tends to establish the one‐way authentication key agreement for both parties. Based on the design of single authentication key, an authentication key agreement for the undocumented public key cryptography is proposed to design a security model for the secure and high‐efficiency undocumented two‐party authentication key agreement. Under random oracle model and standard model, the security of the undocumented two‐party authentication key agreement is authenticated. Furthermore, aiming at the computational efficiency, communication efficiency, and key exchange frequency of group key management agreements, this paper aims to propose a method for dynamic membership. Besides, regarding the secure communication environment in different application backgrounds, such as the network applications of Grid, P2P, and ad‐hoc, it would propose practical group key agreements for networks and multi‐node communications to promote the security of group key management and to facilitate the computation of agreements and the optimization of communications. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Dec 10, 2013•5 citations

IDOAKE: strongly secure ID‐based one‐pass authenticated key exchange protocol

Hai Huang, Zhenfu Cao

Abstract ID‐based one‐pass authenticated key exchange protocol allows the sender Alice to generate a session key without interacting with receiver Bob. As a result, it is better suitable for some application scenarios than the two‐pass counterpart. However, currently there are few ID‐based one‐pass authenticated key exchange protocols with a security proof in a formal model. The paper investigates the ID‐based one‐pass authenticated key exchange protocol in the enhanced Canetti–Krawczyk (eCK) model. We propose a new ID‐based one‐pass authenticated key exchange protocol IDOAKE, which is shown secure under Bilinear Diffie–Hellman (BDH) assumption in the eCK model. To the best of our knowledge, our protocol is the first provably secure ID‐based one‐pass authenticated key exchange in the eCK model. Copyright © 2010 John Wiley & Sons, Ltd.

Security and Communication Networks•Dec 3, 2010•5 citations
Abstract Authenticated key exchange (AKE) is a very important primitive in cryptography. In the last decades, many AKE protocols appeared either in the certificate‐based (cert‐based) setting or in the identity‐based (id‐based) setting. In real applications, entities from different settings may also have the requirement to communicate with each other. Several papers have concentrated on supporting either multiple certification authorities or multiple key generation centers, but very few have considered the interoperability between the two settings. Furthermore, existing approaches are still inadequate in supporting parameters from different algebraic groups. In this paper, we consider AKE protocols integrating cert‐based and id‐based settings with varied groups. Based on two extract algorithms for id‐based entities, we present two AKE protocols where one entity is cert‐based and the other is id‐based, and the parameters of both entities come from different groups. An extended AKE security model of Chatterjee et al. and Ustaoǧlu [1, 2] is proposed to support multiple certification authorities and multiple key generation centers in which the proposed protocols are proved to be secure. Other variant protocols are also presented. Then, extensions to support forward secrecy and resistance to leakage of both ephemeral keys are provided. Finally, we present a more efficient integrating protocol than existing constructions for users who use the same group. Copyright © 2013 John Wiley & Sons, Ltd.
Identity-based authenticated key exchange (ID-AKE) protocol is an important cryptographic primitive, which is used to establish a session key between two communication participants while authenticating each other. Indeed, most of the existing ID-AKE protocols do not concern with side-channel attacks in the sense that adversaries could obtain partial information of ephemeral/permanent secret keys of users. Recently, several leakage-resilient ID-AKE (LR-ID-AKE) protocols have been proposed to address such attacks. However, these LR-ID-AKE protocols have a restriction that the total leakage information during the life time of the LR-ID-AKE protocol must be bounded to some ratio of ephemeral/permanent secret keys. In this paper, the authors define a new adversary model, termed as identity-based continuous-leakage extended Canetti-Krawczyk (ID-CL-eCK) model. Using the key refreshing procedure (i.e., the multiplicative blinding technique) of permanent secret keys, the first LR-ID-AKE protocol resilient to continuous key leakage is proposed, and it possesses overall unbounded leakage property. Comparisons are given to demonstrate that the proposed protocol is better than the previously proposed ID-AKE protocols in terms of security models and leakage properties. Under the generic bilinear group model, security analysis is made to show that the proposed LR-ID-AKE protocol is secure against adversaries in the new ID-CL-eCK model.
Abstract In the traditional identity‐based cryptography, a user, who holds multiple identities, has to manage multiple private keys, where each private key is associated with an identity. In this paper, we present a key agreement protocol, which allows a single private key to map multiple public keys (identities) that are selectable by the user. That is, the established session key is associated with an arbitrary subset of identities held by the user, while the unselected identities remain secret to other participants. As a bonus, our scheme can be considered as a credential‐based key agreement, where the unique private key can be treated as a credential of the user and the user only proves that his credential is associated with some selected identities. We prove that our scheme is secure in the random oracle model. Copyright © 2010 John Wiley & Sons, Ltd.
In CRYPTO 2021, Han et al. proposed a PKI-based authenticated key exchange (AKE) scheme that satisfies tight security in the standard model by using KEM and digital signature with multi-user security as building blocks. On the other hand, no tightly secure ID-based AKE (ID-AKE) scheme is known. ID-AKE has the advantage that certificate management is unnecessary, and the authentication can be based on the party’s public ID, such as an e-mail address. In this paper, we propose the first tightly secure ID-AKE scheme in the standard model. First, we extend the security model of Han et al.’s PKI-based AKE to the security model for ID-AKE. Next, we introduce a generic construction with multi-user secure KEM and ID-based signature (IBS) as building blocks and prove the tight security in our security model. For instantiating the underlying IBS, we also revisit the security proof of the existing generic construction of tightly secure IBS proposed by Lee et al. We point out a problem in their proof and correct it by strengthening an assumption. As an instantiation of our scheme, a tightly secure ID-AKE scheme under the MDDH assumption can be realized in the standard model.
ABSTRACT In regard to the communication security of open networks, authenticated key management agreements are able to provide confidentiality, integrity, and verification so as to establish a more secure and fair digital rights management mechanism. For this reason, this paper, aiming at authentication key management agreements, tends to provide a security study on the application of authentication key management agreements, covering the establishment, analysis, design, security study, and performance optimization in various environments. Based on present public key schemes, such as public key cryptography, identity‐recognized cryptography, and undocumented cryptography, it aims to establish an authenticated key management agreement suitable for various application environments. Using the one‐way transmission in identity‐recognized cryptography or undocumented cryptography for formulating practical and effective security models, it tends to establish the one‐way authentication key agreement for both parties. Based on the design of single authentication key, an authentication key agreement for the undocumented public key cryptography is proposed to design a security model for the secure and high‐efficiency undocumented two‐party authentication key agreement. Under random oracle model and standard model, the security of the undocumented two‐party authentication key agreement is authenticated. Furthermore, aiming at the computational efficiency, communication efficiency, and key exchange frequency of group key management agreements, this paper aims to propose a method for dynamic membership. Besides, regarding the secure communication environment in different application backgrounds, such as the network applications of Grid, P2P, and ad‐hoc, it would propose practical group key agreements for networks and multi‐node communications to promote the security of group key management and to facilitate the computation of agreements and the optimization of communications. Copyright © 2013 John Wiley & Sons, Ltd.
Abstract ID‐based one‐pass authenticated key exchange protocol allows the sender Alice to generate a session key without interacting with receiver Bob. As a result, it is better suitable for some application scenarios than the two‐pass counterpart. However, currently there are few ID‐based one‐pass authenticated key exchange protocols with a security proof in a formal model. The paper investigates the ID‐based one‐pass authenticated key exchange protocol in the enhanced Canetti–Krawczyk (eCK) model. We propose a new ID‐based one‐pass authenticated key exchange protocol IDOAKE, which is shown secure under Bilinear Diffie–Hellman (BDH) assumption in the eCK model. To the best of our knowledge, our protocol is the first provably secure ID‐based one‐pass authenticated key exchange in the eCK model. Copyright © 2010 John Wiley & Sons, Ltd.