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

Message Policy Attribute Based Key Agreement Protocol

Wang Yong-ta

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

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).

Related papers

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•16 citations

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

New Identity-based Authenticated Key Agreement Protocol

Hui Ding, Yin Xin-chun

This paper designs an identity-based authenticated key agreement protocol with perfect forward security of Private Key Generator(PKG).It is proved to provide known key security,forward secrecy,key-compromise impersonation and so on in standard model.Its security is based on Bilinear Decisional Diffie-Hellman(BDDH) assumption,so its security is higher than the protocols based on the weaker assumption.

Jisuanji gongcheng•Jan 1, 2010•0 citations

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Zhang Qikun, Yongjiao Li, Yong Gan +3 more

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.

IEEE Access•Jan 1, 2019•28 citations

Attribute-Based Authenticated Key Agreement Protocol Secure in ABeCK Model

Gao Hai

Attribute-based authenticated key agreement(ABAKA) protocol is used to establish session key among parties in the communication environment in which the identity information of individual is protected.Attribute-based extended Canetti-Krawczyk(ABe CK) model is a model with more security applying to the security proof of ABAKE protocol.This paper presents gap computational parallel bilinear Diffie-Hellman exponent(GCPBDHE) assumption based on gap computational Diffie-Hellman(GCDH) assumption.Based on Waters scheme,it establishes an ABAKA protocol,and proves its security in ABe CK model under GCPBDHE and CDH assumptions.Compared with the existing ABAKE protocols,the new protocol is more efficient in communication cost.

•Jan 1, 2015•0 citations

Attribute-based Authenticated Key Exchange Protocol in Multiple Attribute Authorities Environment

Pla Information

Available Attribute-Based Authenticated Key Exchange(ABAKE) protocols are all designed in the single Attribute Authority(AA) environment.However,secure communication is in demand between parties from different Attribute Authorities(AAs).Based on Waters' attribute-based encryption scheme,an ABAKE protocol is proposed in multiple AAs environment and the security of the proposed protocol is reduced to Gap Bilinear Diffie-Hellman(GBDH) and Computational Diffie-Hellman(CDH) assumptions in the Attribute-Based extended Canetti-Krawczyk(ABeCK) model.Moreover,the scheme,which transmits attribute authentication policy represented by linear secret sharing scheme via Boolean formulas,can express flexible policies and decrease communication cost drastically.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 1, 2012•0 citations
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).
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.
Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.
Attribute-based authenticated key agreement(ABAKA) protocol is used to establish session key among parties in the communication environment in which the identity information of individual is protected.Attribute-based extended Canetti-Krawczyk(ABe CK) model is a model with more security applying to the security proof of ABAKE protocol.This paper presents gap computational parallel bilinear Diffie-Hellman exponent(GCPBDHE) assumption based on gap computational Diffie-Hellman(GCDH) assumption.Based on Waters scheme,it establishes an ABAKA protocol,and proves its security in ABe CK model under GCPBDHE and CDH assumptions.Compared with the existing ABAKE protocols,the new protocol is more efficient in communication cost.
Available Attribute-Based Authenticated Key Exchange(ABAKE) protocols are all designed in the single Attribute Authority(AA) environment.However,secure communication is in demand between parties from different Attribute Authorities(AAs).Based on Waters' attribute-based encryption scheme,an ABAKE protocol is proposed in multiple AAs environment and the security of the proposed protocol is reduced to Gap Bilinear Diffie-Hellman(GBDH) and Computational Diffie-Hellman(CDH) assumptions in the Attribute-Based extended Canetti-Krawczyk(ABeCK) model.Moreover,the scheme,which transmits attribute authentication policy represented by linear secret sharing scheme via Boolean formulas,can express flexible policies and decrease communication cost drastically.