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

Quantum Information Processing

Efficient quantum multi-authority attribute-based encryption and generalizations

Shion Samadder Chaudhury

Published Sep 26, 2024• 1 citation
Publisher
DOI
10.1007/s11128-024-04538-z

Related papers

Quantum attribute-based encryption: a comprehensive study

Shion Samadder Chaudhury, Asmita Samanta, Arpita Maitra

Quantum Information Processing•Sep 3, 2023•2 citations

Multi-Authority Attribute-Based Encryption Scheme from Lattices

Guoyan Zhang, Jing Qin, Shams Qazi

Access control can selectively restrict access to sensitive information stored by third-party sites on the Internet. Attribute-based encryption (ABE) schemes can strengthen the effective combination of flexibility and operability of access control. They allow one sender to encrypt a message for more than one recipient, and to specify who should be able to decrypt, using attributes alone. Since 2005, many powerful ABE schemes have been presented, but there are two types of problem that haven't be efficiently resolved so far. On the one hand, as practical extension of identity-based encryption (IBE) schemes, ABE schemes are also confronted with key escrow problem. On the other hand, attribute set belonging to one user is usually monitored by different authorities in this era of collaboration. Multi-authority ABE (MA-ABE) schemes can simultaneously resolve these problems, but now they have not been thoroughly investigated yet. More precisely, MA-ABE schemes against quantum attack are the main barrier of the development of ABE schemes in a 'post-quantum' world. In this paper, we firstly present a MA-ABE scheme from lattices, in which identities of users are authenticated by a central authority, which improves the efficiency of authentication. Furthermore, different attribute private keys are still distributed by different authorities, and the central authority cannot obtain any secret information of other attribute authorities, which resolves key escrow problem to some extent. In MAABE, attribute private keys belonging to one user are generated by different authorities, and how to ensure correct decryption is one of the crux of schemes. Our scheme gives a simple solution, and each user's attribute private keys are combined using sharing of common public information to automatically realize correct decryption. To our best knowledge, this is the first MA-ABE scheme from lattices, and it is more efficient than the MA-ABE presented by Melissa Chase. Finally, we present a multi-authority large universe ABE scheme, in which the sizes of the public key and the ciphertext are only relative to the number of the attribute authorities, and a user will be able to decrypt a ciphertext if and only if he has at least tK attributes from each authority K.

JUCS - Journal of Universal Computer Science•Apr 7, 2020•20 citations

Revocable multi-authority attribute-based encryption from lattice in cloud storage

Wei Wen, Rui Jiang

With the rapid development of quantum computing technology, data sharing systems in cloud storage may suffer from quantum computing attacks. Recently, many researchers have proposed encryption schemes to achieve quantum attack resistance and fine-grained data access control. However, single point of failure and secure attribute revocation are two critical problems for quantum-resistant encryption scheme in cloud storage environments. In order to deal with these problems, in this paper, we propose a revocable multi-authority attribute-based encryption from lattice (RMA-ABE-L) in cloud storage. Firstly, RMA-ABE-L scheme can achieve fine-grained data access control with quantum computing attack resistance. We design efficient anti-quantum algorithms based on R-LWE problem and merge them with ciphertext-policy attribute-based encryption (CP-ABE) structure. Secondly, RMA-ABE-L scheme can solve the single point of failure problem. We design the multi-authority structure to so that the compromise of some authorities does not affect the functioning of the whole data sharing system. Moreover, RMA-ABE-L scheme can realize secure attribute revocation. We design a secure attribute revocation mechanism and set special identity construction. The performance analysis shows that RMA-ABE-L scheme is more efficient than other related schemes.

International Conference on Computer Information Science and Application Technology (CISAT)•Oct 11, 2023•0 citations

Designing quantum-secure attribute-based encryption

Y. Sreenivasa Rao, Vikas Srivastava, Tapaswini Mohanty +1 more

Cluster Computing•Jun 22, 2024•0 citations

Multi-Authority Attribute-Based Multi-Keyword Searchable Encryption with Dynamic Membership from Lattices

Er-Shuo Zhuang, Chia‐Yu Lin, Chun‐I Fan +2 more

With the growing need for secure cloud storage and the threat of quantum attacks, we propose a post-quantum secure lattice-based multi-authority attribute-based multi-keyword searchable encryption scheme with dynamic membership. Based on the decisional learning with errors assumption, the proposed scheme resists quantum adversaries while supporting flexible multi-keyword search, decentralized authority to avoid key escrow, and dynamic attribute updates without affecting other users. It enables users to independently generate search tokens, allowing offline authorities and reducing communication overhead. Despite higher encryption costs, experimental results demonstrate that search and decryption remain efficient compared to existing post-quantum lattice-based solutions. The proposed scheme achieves strong data confidentiality and keyword privacy in the post-quantum setting.

IEEE Conference on Dependable and Secure Computing (DSC)•Oct 18, 2025•0 citations

Applied quantum cryptography: beyond end-to-end encryption

Charles Ci Wen Lim

Quantum Computing, Communication, and Simulation•Mar 8, 2023•0 citations
Access control can selectively restrict access to sensitive information stored by third-party sites on the Internet. Attribute-based encryption (ABE) schemes can strengthen the effective combination of flexibility and operability of access control. They allow one sender to encrypt a message for more than one recipient, and to specify who should be able to decrypt, using attributes alone. Since 2005, many powerful ABE schemes have been presented, but there are two types of problem that haven't be efficiently resolved so far. On the one hand, as practical extension of identity-based encryption (IBE) schemes, ABE schemes are also confronted with key escrow problem. On the other hand, attribute set belonging to one user is usually monitored by different authorities in this era of collaboration. Multi-authority ABE (MA-ABE) schemes can simultaneously resolve these problems, but now they have not been thoroughly investigated yet. More precisely, MA-ABE schemes against quantum attack are the main barrier of the development of ABE schemes in a 'post-quantum' world. In this paper, we firstly present a MA-ABE scheme from lattices, in which identities of users are authenticated by a central authority, which improves the efficiency of authentication. Furthermore, different attribute private keys are still distributed by different authorities, and the central authority cannot obtain any secret information of other attribute authorities, which resolves key escrow problem to some extent. In MAABE, attribute private keys belonging to one user are generated by different authorities, and how to ensure correct decryption is one of the crux of schemes. Our scheme gives a simple solution, and each user's attribute private keys are combined using sharing of common public information to automatically realize correct decryption. To our best knowledge, this is the first MA-ABE scheme from lattices, and it is more efficient than the MA-ABE presented by Melissa Chase. Finally, we present a multi-authority large universe ABE scheme, in which the sizes of the public key and the ciphertext are only relative to the number of the attribute authorities, and a user will be able to decrypt a ciphertext if and only if he has at least tK attributes from each authority K.
With the rapid development of quantum computing technology, data sharing systems in cloud storage may suffer from quantum computing attacks. Recently, many researchers have proposed encryption schemes to achieve quantum attack resistance and fine-grained data access control. However, single point of failure and secure attribute revocation are two critical problems for quantum-resistant encryption scheme in cloud storage environments. In order to deal with these problems, in this paper, we propose a revocable multi-authority attribute-based encryption from lattice (RMA-ABE-L) in cloud storage. Firstly, RMA-ABE-L scheme can achieve fine-grained data access control with quantum computing attack resistance. We design efficient anti-quantum algorithms based on R-LWE problem and merge them with ciphertext-policy attribute-based encryption (CP-ABE) structure. Secondly, RMA-ABE-L scheme can solve the single point of failure problem. We design the multi-authority structure to so that the compromise of some authorities does not affect the functioning of the whole data sharing system. Moreover, RMA-ABE-L scheme can realize secure attribute revocation. We design a secure attribute revocation mechanism and set special identity construction. The performance analysis shows that RMA-ABE-L scheme is more efficient than other related schemes.
With the growing need for secure cloud storage and the threat of quantum attacks, we propose a post-quantum secure lattice-based multi-authority attribute-based multi-keyword searchable encryption scheme with dynamic membership. Based on the decisional learning with errors assumption, the proposed scheme resists quantum adversaries while supporting flexible multi-keyword search, decentralized authority to avoid key escrow, and dynamic attribute updates without affecting other users. It enables users to independently generate search tokens, allowing offline authorities and reducing communication overhead. Despite higher encryption costs, experimental results demonstrate that search and decryption remain efficient compared to existing post-quantum lattice-based solutions. The proposed scheme achieves strong data confidentiality and keyword privacy in the post-quantum setting.