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

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)

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

Hao Wang, Qiuliang Xu, Tao Ban

Published Sep 1, 2009• 16 citations
Publisher

Abstract

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.

DOI
10.1109/iih-msp.2009.92

Related papers

Revocable Attribute-based Key Agreement Protocol without Random Oracles

Hao Wang, Qiuliang Xu, Xiu Fen Fu

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.

Journal of Networks•Oct 1, 2009•13 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

A Provably Secure Identity-Based Key Agreement Protocol from Key Encapsulation Scheme

Yang Cai, Qiuliang Xu, Zhihua Zheng

In this paper, we present a two-party key agreement protocol, which is secure in standard model. By using the Goldreich-Levin hardcore predicate, we reduce the security of our scheme to Computational Bilinear Diffie-Hellman assumption, and a proof is given. Furthermore, with the consistency of messages exchanged publicly verifiable, our scheme achieves most of the known security attributes.

International Conference on Computational Intelligence and Security (CIS)•Nov 1, 2012•1 citation

An Identity-Based Group Key Agreement Protocol from Pairing

Hongji Wang, Gang Yao, Qingshan Jiang

In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•10 citations

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 citations

Message Policy Attribute Based Key Agreement Protocol

Wang Yong-ta

We proposed a message policy attribute based key agreement protocol.Attribute based key agreement protocol has many characteristics,the main of which is fuzzy identification.This paper discussed the application of fuzzy identification in key agreement protocol,and constructed a two-party message policy attribute based key agreement protocol,where the message policy is And-gates on two valued attribute.In addition,the new protocol was proved secure in the standard model under the decisional bilinear Diffie-Hellman assumption(DBDH).

•Jan 1, 2013•0 citations
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.
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.
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
We proposed a message policy attribute based key agreement protocol.Attribute based key agreement protocol has many characteristics,the main of which is fuzzy identification.This paper discussed the application of fuzzy identification in key agreement protocol,and constructed a two-party message policy attribute based key agreement protocol,where the message policy is And-gates on two valued attribute.In addition,the new protocol was proved secure in the standard model under the decisional bilinear Diffie-Hellman assumption(DBDH).