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

Modern Electronics Technique

Provable Secure Key Exchange Based on Attribute

Hao Yun-fang

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

With the extension of identity-based cryptography,the attribute-based encryption haas been used to control different authorities of decrypting a cipher-text among different users in a more flexible manner.Thus attribute-based encryption has become a hot research topic nowadays.With the development of attribute-based encryption,the attribute-based key exchange has also become a point which attracts a great deal of attention.The distinctive features of key exchange protocols are analyzed.An attribute-based key exchange based on Sahai-Waters attribute-based encryption is proposed,which can flexibly control the access authority of different users.The protocol requires only one round of message sending.Moreover,based on the security request of key exchange protocols,a new security definition for attribute-based key exchange protocol is given.The security of the protocol is proved with the standard model.

Related papers

Security Verification of Key Exchange in Ciphertext-Policy Attribute Based Encryption

Baasansuren Bat-Erdene, Yuping Yan, Mohammed B. Alshawki +1 more

Attribute-based encryption (ABE) is an extension scheme of identity-based encryption and public-key encryption. It can achieve fine-grained access control and one-to-many encryption mode, suitable for practical applications. In addition to mathematical proofs, it is essential to verify its security properties using different protocols. This paper proposes two key exchange protocols to securely exchange the user secret keys in ABE. ProVerif is an automated cryptographic protocol verifier that we have used during protocol verification. We specifically aim to protect the confidentiality of the generated keys. The proposed protocols are formally analysed and their security property has been formally proved.

2022 7th International Conference on Signal and Image Processing (ICSIP)•Jul 20, 2022•5 citations

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

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

One-Round Attribute-Based Key Exchange in the Multi-Party Setting

Yangguang Tian, Guomin Yang, Yi Mu +3 more

Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.

International Journal of Foundations of Computer Science•Sep 1, 2017•1 citation

Multiauthority Attribute-Based Encryption With Dynamic Membership From Lattices

Er-Shuo Zhuang, Chun‐I Fan, I-Hua Kuo

Attribute-based encryption is useful for one-to-many encrypted message sending. However, most attribute-based encryption schemes authorize and issue attributes to users by a single authority. Such a scenario conflicts with practical requirements and may cause the key-escrow problem. Hence, decentralization of authority is a critical issue in attribute-based encryption. Besides, dynamic membership management is another important issue in attribute-based encryption. With dynamic membership management, a system may update the user’s attributes without affecting other users, making the system more flexible and practical. On the other hand, with the rapid development of quantum computers nowadays, encryption schemes based on traditional mathematical problems are at the risk of quantum attacks. Among the existing quantum-resistant mathematical architectures, lattice-based cryptography is the most widely studied. Thus, we propose a multi-authority attribute-based encryption scheme with dynamic membership from lattices to solve the above problems. Moreover, we also formally prove the security of the proposed scheme under the decisional learning with errors assumption.

IEEE Access•Jan 1, 2022•10 citations

Quantum Key-Policy Attribute-based Encryption

Gabriela Mogos

Attribute-Based Encryption is a relatively new concept in the field of cryptography, and it allows only the authorized entities to decrypt a message. This type of encryption is the mechanism by which the users may encrypt and decrypt data based on user attributes. This paper proposes the first quantum alternative of the scheme Key-Policy Attribute-Based Encryption, where the information, the encryption/decryption key, and the attributes are made of qutrits.

Indonesian Journal of Electrical Engineering and Computer Science•Aug 1, 2017•2 citations
With the extension of identity-based cryptography,the attribute-based encryption haas been used to control different authorities of decrypting a cipher-text among different users in a more flexible manner.Thus attribute-based encryption has become a hot research topic nowadays.With the development of attribute-based encryption,the attribute-based key exchange has also become a point which attracts a great deal of attention.The distinctive features of key exchange protocols are analyzed.An attribute-based key exchange based on Sahai-Waters attribute-based encryption is proposed,which can flexibly control the access authority of different users.The protocol requires only one round of message sending.Moreover,based on the security request of key exchange protocols,a new security definition for attribute-based key exchange protocol is given.The security of the protocol is proved with the standard model.
Attribute-based encryption (ABE) is an extension scheme of identity-based encryption and public-key encryption. It can achieve fine-grained access control and one-to-many encryption mode, suitable for practical applications. In addition to mathematical proofs, it is essential to verify its security properties using different protocols. This paper proposes two key exchange protocols to securely exchange the user secret keys in ABE. ProVerif is an automated cryptographic protocol verifier that we have used during protocol verification. We specifically aim to protect the confidentiality of the generated keys. The proposed protocols are formally analysed and their security property has been formally proved.
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.
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.
Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.
Attribute-based encryption is useful for one-to-many encrypted message sending. However, most attribute-based encryption schemes authorize and issue attributes to users by a single authority. Such a scenario conflicts with practical requirements and may cause the key-escrow problem. Hence, decentralization of authority is a critical issue in attribute-based encryption. Besides, dynamic membership management is another important issue in attribute-based encryption. With dynamic membership management, a system may update the user’s attributes without affecting other users, making the system more flexible and practical. On the other hand, with the rapid development of quantum computers nowadays, encryption schemes based on traditional mathematical problems are at the risk of quantum attacks. Among the existing quantum-resistant mathematical architectures, lattice-based cryptography is the most widely studied. Thus, we propose a multi-authority attribute-based encryption scheme with dynamic membership from lattices to solve the above problems. Moreover, we also formally prove the security of the proposed scheme under the decisional learning with errors assumption.