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

Attribute-Based Authenticated Key Agreement Protocol Secure in ABeCK Model

Gao Hai

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

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.

Related papers

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

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer Applications•Jan 1, 2012•0 citations

eCK-security authenticated key agreement protocol based on CDH assumption

Mengzhi Liu, Yanli Zhao, Shuying Chen

By far, the extended Canetti-Krawczyk (eCK) model still is one of strongest security model for authenticated key exchange (AKE) protocols. In this paper, a secure authenticated key agreement protocol named SAKA is analyzed in the model, the results show that the SAKA protocol does not support forward security which all key exchange protocol should satisfy. Furthermore, it does not meet security goals of the eCK model. In order to overcome all of above flaws, a variant of SAKA protocol is proposed based on Computation Diffie-Hellman assumption, and secure analysis shows that the new protocol has some good security properties including perfect forward secrecy and known session key excepting those desired security properties that SAKA has. Furthermore, fewer number of modular exponentiation indicates that the new scheme is more efficient.

IEEE International Conference on Computer and Communications (ICCC)•Oct 1, 2016•1 citation

Strongly Secure Identity-based Authenticated Key Exchange Protocol

Jian Shu

Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.

Journal of Chinese Computer Systems•Jan 1, 2011•0 citations

Efficient single round attribute-based authenticated key exchange protocol

Suvradip Chakraborty, Y. Sreenivasa Rao, Chandrasekharan Pandu Rangan

Attribute-Based Authenticated Key Exchange (ABAKE) protocols allow two or more users to establish a shared key and achieve mutual authentication over an insecure network, while providing fine-grained access control over transmitted data. The existing ABAKE protocols are very inefficient, requiring a large number (polynomial in the size of the access policies) of pairing and exponentiation operations. This presents a major hindrance in the real-world deployment of these protocols. In this work, we present a construction of ABAKE protocol where the number of pairing operations is constant (to be precise only 7) and the number of exponentiation operations is linear to the number of clauses in the disjunctive normal form representing the general access policies. To this end, we construct an Attribute-Based Signcryption (ABSC) scheme with constant number of pairings, and use it as the main building block in our ABAKE construction. This also gives the first construction of ABSC schemes with constant number of pairings for general purpose access policies in the standard model. Another important and desirable feature of our ABAKE construction is that it is round-optimal, i.e. it is a single round protocol. We analyse the security of our ABAKE construction in the Attribute-Based extended Canetti-Krawzyck (ABeCK) model, and prove its security assuming the hardness of a variant of the Bilinear Diffie-Hellman Exponent problem in the random oracle model.

International Journal of Computer Mathematics Computer Systems Theory•Jan 14, 2021•3 citations

Enhanced Attribute-Based Authenticated Key Agreement Protocol in the Standard Model

Liping Qian

In this paper,we propose an enhanced attribute-based authenticated key agreement(ABAKA)protocol in the standard model.We construct our protocol based on Waters' ciphertextpolicy attribute-based encryption with a simple and compact conversion technique to the chosenplaintext attack(CPA)security from the chosen-ciphertext attack(CCA)security.The protocol is provably secure in the CK+ model which provides the strongest definition of security for authenticated key agreement protocol at present.The protocol can provide weak perfect forward secrecy and resist key compromise impersonation and leakage of ephemeral key attacks.Compared with the existing ABAKA protocols,our protocol is more efficient in communication cost and obtains stronger security.

Chinese Journal of Computers•Jan 1, 2013•0 citations
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.
Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.
By far, the extended Canetti-Krawczyk (eCK) model still is one of strongest security model for authenticated key exchange (AKE) protocols. In this paper, a secure authenticated key agreement protocol named SAKA is analyzed in the model, the results show that the SAKA protocol does not support forward security which all key exchange protocol should satisfy. Furthermore, it does not meet security goals of the eCK model. In order to overcome all of above flaws, a variant of SAKA protocol is proposed based on Computation Diffie-Hellman assumption, and secure analysis shows that the new protocol has some good security properties including perfect forward secrecy and known session key excepting those desired security properties that SAKA has. Furthermore, fewer number of modular exponentiation indicates that the new scheme is more efficient.
Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.
Attribute-Based Authenticated Key Exchange (ABAKE) protocols allow two or more users to establish a shared key and achieve mutual authentication over an insecure network, while providing fine-grained access control over transmitted data. The existing ABAKE protocols are very inefficient, requiring a large number (polynomial in the size of the access policies) of pairing and exponentiation operations. This presents a major hindrance in the real-world deployment of these protocols. In this work, we present a construction of ABAKE protocol where the number of pairing operations is constant (to be precise only 7) and the number of exponentiation operations is linear to the number of clauses in the disjunctive normal form representing the general access policies. To this end, we construct an Attribute-Based Signcryption (ABSC) scheme with constant number of pairings, and use it as the main building block in our ABAKE construction. This also gives the first construction of ABSC schemes with constant number of pairings for general purpose access policies in the standard model. Another important and desirable feature of our ABAKE construction is that it is round-optimal, i.e. it is a single round protocol. We analyse the security of our ABAKE construction in the Attribute-Based extended Canetti-Krawzyck (ABeCK) model, and prove its security assuming the hardness of a variant of the Bilinear Diffie-Hellman Exponent problem in the random oracle model.
In this paper,we propose an enhanced attribute-based authenticated key agreement(ABAKA)protocol in the standard model.We construct our protocol based on Waters' ciphertextpolicy attribute-based encryption with a simple and compact conversion technique to the chosenplaintext attack(CPA)security from the chosen-ciphertext attack(CCA)security.The protocol is provably secure in the CK+ model which provides the strongest definition of security for authenticated key agreement protocol at present.The protocol can provide weak perfect forward secrecy and resist key compromise impersonation and leakage of ephemeral key attacks.Compared with the existing ABAKA protocols,our protocol is more efficient in communication cost and obtains stronger security.