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

Journal of Networks

Revocable Attribute-based Key Agreement Protocol without Random Oracles

Hao Wang, Qiuliang Xu, Xiu Fen Fu

Published Oct 1, 2009• 13 citations
Publisher

Abstract

Abstract—In this paper, we present a two-party attribute-based key agreement protocol, which is secure in the standard model (without random oracles), under the truncated decision q-ABDHE assumption. Then we give a modified version of this scheme, in which the users can be revoked efficiently. The attribute-based key agreement protocol is based on the attribute-based encryption scheme, which is a generalization of identity-based cryptosystems, incorporates attributes as inputs to its cryptographic primitives. These kinds of schemes not only preserve the advantages of traditional identity-based key agreement protocol, but also provide some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management, and providing efficient means to revoke users from the system. Index Terms—attribute-based key agreement, without random oracles, revocation I.

DOI
10.4304/jnw.4.8.787-794

Related papers

Two-Party Attribute-based Key Agreement Protocol in the Standard Model

Hao Wang, Qichao Xu, Xiu Fen Fu

Abstract—We present a new two-party attribute-based key agreement protocol that is secure without the random oracle model in groups equipped with a bilinear map. The attribute-based key agreement scheme is one type of the identity-based key agreement scheme, in which the identity can be viewed as a set of descriptive attributes. These kinds of schemes provide some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management, and providing efficient means to revoke users from the system. Index Terms—attribute-based key agreement, without random oracles I.

•Aug 20, 2013•1 citation

A Provably Secure Two-Party Attribute-Based Key Agreement Protocol

Hao Wang, Qiuliang Xu, Tao Ban

In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive attributes. Our scheme not only preserves the advantages of traditional identity-based key agreement protocol, but also provides some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Sep 1, 2009•17 citations

Provably Secure Identity-Based Authenticated Key Agreement Protocols in the Standard Model

Sheng Wang

This paper presents an identity-based key agreement protocols that are provably secure without random oracles(namely,in the standard model).It is inspired by a new identity-based encryption scheme first proposed by Gentry.This paper details how this key agreement can be used in either escrowed or escrowless mode.All the proposed protocols are compared performance(with respect to computational and communication efficiencies) to all known protocols that are only proven secure in the random oracle model.

Chinese Journal of Computers•Jan 1, 2007•18 citations

Provably secure identity-based key agreement protocols under simple assumption

Xiufeng Zhao, Qiuliang Xu, Hao Wang

In this paper, we present a two-party identity-based key agreement protocol, which is provably secure without random oracles under three static assumptions. It is inspired on a new identity-based encrypt system proposed in TCC 2010 by Lewko and Waters. We show how this key agreement can be used in either escrowed or escrowless mode. We also modify the protocol in the escrow to provide perfect forward secrecy property.

IEEE International Conference on Information Theory and Information Security•Dec 1, 2010•1 citation

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

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
Abstract—In this paper, we present a two-party attribute-based key agreement protocol, which is secure in the standard model (without random oracles), under the truncated decision q-ABDHE assumption. Then we give a modified version of this scheme, in which the users can be revoked efficiently. The attribute-based key agreement protocol is based on the attribute-based encryption scheme, which is a generalization of identity-based cryptosystems, incorporates attributes as inputs to its cryptographic primitives. These kinds of schemes not only preserve the advantages of traditional identity-based key agreement protocol, but also provide some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management, and providing efficient means to revoke users from the system. Index Terms—attribute-based key agreement, without random oracles, revocation I.
Abstract—We present a new two-party attribute-based key agreement protocol that is secure without the random oracle model in groups equipped with a bilinear map. The attribute-based key agreement scheme is one type of the identity-based key agreement scheme, in which the identity can be viewed as a set of descriptive attributes. These kinds of schemes provide some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management, and providing efficient means to revoke users from the system. Index Terms—attribute-based key agreement, without random oracles I.
In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive attributes. Our scheme not only preserves the advantages of traditional identity-based key agreement protocol, but also provides some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management.
This paper presents an identity-based key agreement protocols that are provably secure without random oracles(namely,in the standard model).It is inspired by a new identity-based encryption scheme first proposed by Gentry.This paper details how this key agreement can be used in either escrowed or escrowless mode.All the proposed protocols are compared performance(with respect to computational and communication efficiencies) to all known protocols that are only proven secure in the random oracle model.
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.
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.