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

Wireless Communications and Mobile Computing

Authenticated key exchange protocol with selectable identities

Hua Guo, Yi Mu, Xiyong Zhang, Zhoujun Li

Published Apr 15, 2010• 3 citations
Publisher

Abstract

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.

DOI
10.1002/wcm.971

Related papers

An attribute‐based tripartite key agreement protocol

Majid Bayat, Mohammad Reza Aref

Summary Tripartite key agreement protocols enable three users to share a common and secure secret key by exchanging some information in a public channel. In this paper, we introduce the first attribute‐based tripartite key agreement protocol, which is a kind of identity‐based tripartite key agreement protocols, which the identities consist of descriptive attributes. Also, we propose an extended security model for these protocols and prove the security of our protocol in the random oracle model.Copyright © 2014 John Wiley & Sons, Ltd.

International Journal of Communication Systems•Jan 7, 2014•3 citations

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Mohammad Sabzinejad Farash, Mahmoud Ahmadian‐Attari

A B S T R A C T Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is generated by a trusted Private Key Generator (PKG). However, it is unrealistic to assume that a single PKG will be responsible for issuing private keys to members of dierent organizations or a large-scale nation. Hence, it is needed to consider multiple PKG environments with dierent system parameters. In this paper, we propose an identity-based key agreement protocol among users of dierent networks with independent PKGs, which makes use of elliptic curves. We prove the security of the proposed protocol in the random oracle model and show that all security attributes are satised. We also demonstrate a comparison between our protocol and some related protocols in terms of the communication costs and the execution time. The results show that the execution time of our protocol is less than 10%, and its communication costs are about 50% of the competitor protocols.

•Jan 1, 2013•20 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

A Complete Anonymous Group Key Agreement Protocol

Gang Yao, Dengguo Feng

Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.

International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC)•Jan 1, 2010•7 citations

AD‐ASGKA – authenticated dynamic protocols for asymmetric group key agreement

Mingchu Li, Xiaodong Xu, Cheng Guo +1 more

Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication Networks•Jan 26, 2016•14 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
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.
Summary Tripartite key agreement protocols enable three users to share a common and secure secret key by exchanging some information in a public channel. In this paper, we introduce the first attribute‐based tripartite key agreement protocol, which is a kind of identity‐based tripartite key agreement protocols, which the identities consist of descriptive attributes. Also, we propose an extended security model for these protocols and prove the security of our protocol in the random oracle model.Copyright © 2014 John Wiley & Sons, Ltd.
A B S T R A C T Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is generated by a trusted Private Key Generator (PKG). However, it is unrealistic to assume that a single PKG will be responsible for issuing private keys to members of dierent organizations or a large-scale nation. Hence, it is needed to consider multiple PKG environments with dierent system parameters. In this paper, we propose an identity-based key agreement protocol among users of dierent networks with independent PKGs, which makes use of elliptic curves. We prove the security of the proposed protocol in the random oracle model and show that all security attributes are satised. We also demonstrate a comparison between our protocol and some related protocols in terms of the communication costs and the execution time. The results show that the execution time of our protocol is less than 10%, and its communication costs are about 50% of the competitor protocols.
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.
Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.
Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.
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.