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

Discover Computing

A structured review of lattice based attribute based encryption methods for post quantum security

Saima Hasib, Akhtar Rasool, Manasi Gyanchandani, Rahul Haripriya, Lalit Kumar

Published Mar 27, 2026• 2 citations
Publisher

Abstract

The rapid advancement of quantum computing threatens to undermine classical cryptographic primitives, creating an urgent need for post-quantum secure alternatives. Lattice-based Attribute-Based Encryption (ABE) has emerged as a promising direction, combining fine-grained access control with quantum resistance derived from lattice assumptions such as Learning With Errors (LWE) and Ring-LWE. This paper presents a systematic literature review of lattice-based ABE schemes published between 2022 and 2025, following the PRISMA methodology to ensure a rigorous and transparent study selection process. From an initial corpus of more than 7,800 studies retrieved across IEEE Xplore, SpringerLink, Elsevier ScienceDirect, MDPI, and Google Scholar, 1,236 studies were screened, resulting in 90 works selected for in-depth qualitative and quantitative synthesis. The review analyzes the evolution of lattice-based ABE in terms of mathematical foundations, security models, performance characteristics, and application domains. Particular emphasis is placed on emerging use cases in cloud computing, the Internet of Things (IoT), healthcare, financial systems, and government compliance, each evaluated against requirements such as revocation support, lightweight design, searchability, and multi-authority governance. Quantitative synthesis reveals uneven feature coverage across the literature: searchability is supported in 45.6% of schemes and lightweight constructions in 36.7%, whereas policy hiding (16.7%) and revocation (22.2%) remain comparatively underexplored. Performance trends indicate ciphertext sizes averaging 5.8 kB per attribute, with only 12% of schemes achieving compact representations below 2 kB. Moreover, fewer than 36% of surveyed constructions provide IND-CCA security, highlighting persistent challenges in achieving robustness against adaptive adversaries. By integrating structured research questions with quantitative trend analysis, this study offers both descriptive and evidence-backed insights into the current state of lattice-based ABE. The findings identify critical gaps in efficiency, security guarantees, and standardization, and inform a forward-looking research roadmap emphasizing lightweight revocation mechanisms, efficient policy hiding, stronger IND-CCA security models, and the need for standardized benchmarking frameworks. This survey thus serves as a comprehensive reference for researchers and practitioners working on post-quantum secure access control systems, particularly in privacy-sensitive domains such as healthcare.

DOI
10.1007/s10791-026-09965-3

Related papers

Post-Quantum Attribute-Based Encryption: a Comprehensive Survey of Lattice-Based and Hybrid Approaches

P. Purnima, Tejaswi Khanna, Deepak Kumar Verma

With quantum computing, traditional methods of encryption have become insufficient. This has led to the need for a transition to more reliable and flexible encryption systems. In this context, we examine the latest approaches to attribute-based encryption ABE schemes based on lattice cryptography and hybrid ones that combine symmetric encryption with public key ABE. These systems give post-quantum security in addition to fine-grained control, adaptive policy dynamic enforcement, and multi-level hierarchical control. We examine the most significant gaps regarding revocation, multi-authority frameworks, and ciphertext-controlled policies using LWE and Ring-LWE. Text length, key management complexity, and system interoperability are practical concerns too. A comparative analysis of five schemes shows each one's strengths and weaknesses. Designating the encryption phase speeds up the key generation process, so we implemented a multithreaded structure to address some of the identified performance constraints. This worked with other researchers designing robust quantum-access-controlled systems.

Artificial Intelligence and Smart Technologies for Sustainability Conference (AISTS)•Aug 21, 2025•0 citations

Correctness proof for a Ring-Learning-with-Errors Multi-Authority Ciphertext-Policy Attribute-Based Encryption Scheme

Jack Loughridge, Charuka Herath, Yogachandran Rahulamathavan +5 more

The advent of quantum computing poses a significant threat to traditional cryptographic algorithms, including RSA, Diffie-Hellman, and Elliptic Curve Cryptography, due to the capabilities of quantum algorithms like Shor’s algorithm. Post-quantum cryptography (PQC) has emerged to address these challenges, with lattice-based cryptography (LBC) being a prominent candidate. LBC, underpinned by hard mathematical problems like Learning with Errors (LWE) and Ring-LWE (RLWE), offers robust security against quantum and classical adversaries. In parallel, Ciphertext-Policy Attribute-Based Encryption (CPABE) has become a critical tool for enabling fine-grained access control in data-sharing scenarios, such as secure cloud storage and IoT. While existing CP-ABE implementations rely on bilinear pairings vulnerable to quantum attacks, lattice-based CPABE schemes provide a quantum-resistant alternative. Despite their potential, these schemes face challenges in computational efficiency, collusion resistance, and implementation correctness. Our contributions include a detailed mathematical breakdown of one of the state-of-the-art (SOTA) lattice-based CP-ABE schemes and a novel correctness proof for the same scheme.

IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW)•Jul 21, 2025•0 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

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Zulianie Binti Jemihin, Tan Soo Fun, Gwo Chin Chung

Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.

Cryptography•Aug 5, 2022•23 citations

mR LWE -CP-ABE: A revocable CP-ABE for post-quantum cryptography

Marco Cianfriglia, E. Onofri, Marco Pedicini

Abstract We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings . In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324–40. doi: https://doi.org/10.1007/978-3-642-34704-7_23 .]. While a lot of work exists on the construction of revocable schemes for CP-ABE based on pairings, works based on lattices are not so common, and – to the best of our knowledge – we introduce the first server-aided revocation scheme in a lattice-based CP-ABE scheme, hence being embedded in a post-quantum secure environment. In particular, we rely on semi-trusted “mediators” to provide a multi-step decryption capable of handling mediation without re-encryption. We comment on the scheme and its application, and we provide performance experiments on a prototype implementation in the Attribute-Based Encryption spin-off library of Palisade to evaluate the overhead compared with the original scheme.

Journal of Mathematical Cryptology•Jan 1, 2024•3 citations

Attribute-based encryption supporting data filtration over post-quantum assumptions

Chunhong Jiao, Xinyin Xiang

As the internet becomes prevalent, plenty of sensitive data is being transferred in open networks environment. It is worth concerning how to achieve efficient data transfer in a privacy-preserving manner. Although attribute-based encryption (ABE) can achieve fine-grained access control over encrypted data, it still could not work for restricting unauthorised user to access. In this paper, we introduce a new cryptographic primitive called attribute-based encryption supporting data filtration (ABE-SDF), and formalise the security mode by incorporating the advantages into previous ABE. Finally, we present an efficient construction of the scheme over post-quantum assumptions our scheme is believed to be quantum-resistant owing to the special property of lattices. Based on the LWE assumption, we prove that the proposed scheme has the indistinguishability against selective chosen plaintext attacks and the authentication information security.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2018•0 citations
The rapid advancement of quantum computing threatens to undermine classical cryptographic primitives, creating an urgent need for post-quantum secure alternatives. Lattice-based Attribute-Based Encryption (ABE) has emerged as a promising direction, combining fine-grained access control with quantum resistance derived from lattice assumptions such as Learning With Errors (LWE) and Ring-LWE. This paper presents a systematic literature review of lattice-based ABE schemes published between 2022 and 2025, following the PRISMA methodology to ensure a rigorous and transparent study selection process. From an initial corpus of more than 7,800 studies retrieved across IEEE Xplore, SpringerLink, Elsevier ScienceDirect, MDPI, and Google Scholar, 1,236 studies were screened, resulting in 90 works selected for in-depth qualitative and quantitative synthesis. The review analyzes the evolution of lattice-based ABE in terms of mathematical foundations, security models, performance characteristics, and application domains. Particular emphasis is placed on emerging use cases in cloud computing, the Internet of Things (IoT), healthcare, financial systems, and government compliance, each evaluated against requirements such as revocation support, lightweight design, searchability, and multi-authority governance. Quantitative synthesis reveals uneven feature coverage across the literature: searchability is supported in 45.6% of schemes and lightweight constructions in 36.7%, whereas policy hiding (16.7%) and revocation (22.2%) remain comparatively underexplored. Performance trends indicate ciphertext sizes averaging 5.8 kB per attribute, with only 12% of schemes achieving compact representations below 2 kB. Moreover, fewer than 36% of surveyed constructions provide IND-CCA security, highlighting persistent challenges in achieving robustness against adaptive adversaries. By integrating structured research questions with quantitative trend analysis, this study offers both descriptive and evidence-backed insights into the current state of lattice-based ABE. The findings identify critical gaps in efficiency, security guarantees, and standardization, and inform a forward-looking research roadmap emphasizing lightweight revocation mechanisms, efficient policy hiding, stronger IND-CCA security models, and the need for standardized benchmarking frameworks. This survey thus serves as a comprehensive reference for researchers and practitioners working on post-quantum secure access control systems, particularly in privacy-sensitive domains such as healthcare.
With quantum computing, traditional methods of encryption have become insufficient. This has led to the need for a transition to more reliable and flexible encryption systems. In this context, we examine the latest approaches to attribute-based encryption ABE schemes based on lattice cryptography and hybrid ones that combine symmetric encryption with public key ABE. These systems give post-quantum security in addition to fine-grained control, adaptive policy dynamic enforcement, and multi-level hierarchical control. We examine the most significant gaps regarding revocation, multi-authority frameworks, and ciphertext-controlled policies using LWE and Ring-LWE. Text length, key management complexity, and system interoperability are practical concerns too. A comparative analysis of five schemes shows each one's strengths and weaknesses. Designating the encryption phase speeds up the key generation process, so we implemented a multithreaded structure to address some of the identified performance constraints. This worked with other researchers designing robust quantum-access-controlled systems.
The advent of quantum computing poses a significant threat to traditional cryptographic algorithms, including RSA, Diffie-Hellman, and Elliptic Curve Cryptography, due to the capabilities of quantum algorithms like Shor’s algorithm. Post-quantum cryptography (PQC) has emerged to address these challenges, with lattice-based cryptography (LBC) being a prominent candidate. LBC, underpinned by hard mathematical problems like Learning with Errors (LWE) and Ring-LWE (RLWE), offers robust security against quantum and classical adversaries. In parallel, Ciphertext-Policy Attribute-Based Encryption (CPABE) has become a critical tool for enabling fine-grained access control in data-sharing scenarios, such as secure cloud storage and IoT. While existing CP-ABE implementations rely on bilinear pairings vulnerable to quantum attacks, lattice-based CPABE schemes provide a quantum-resistant alternative. Despite their potential, these schemes face challenges in computational efficiency, collusion resistance, and implementation correctness. Our contributions include a detailed mathematical breakdown of one of the state-of-the-art (SOTA) lattice-based CP-ABE schemes and a novel correctness proof for the same scheme.
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.
Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.
Abstract We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings . In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324–40. doi: https://doi.org/10.1007/978-3-642-34704-7_23 .]. While a lot of work exists on the construction of revocable schemes for CP-ABE based on pairings, works based on lattices are not so common, and – to the best of our knowledge – we introduce the first server-aided revocation scheme in a lattice-based CP-ABE scheme, hence being embedded in a post-quantum secure environment. In particular, we rely on semi-trusted “mediators” to provide a multi-step decryption capable of handling mediation without re-encryption. We comment on the scheme and its application, and we provide performance experiments on a prototype implementation in the Attribute-Based Encryption spin-off library of Palisade to evaluate the overhead compared with the original scheme.
As the internet becomes prevalent, plenty of sensitive data is being transferred in open networks environment. It is worth concerning how to achieve efficient data transfer in a privacy-preserving manner. Although attribute-based encryption (ABE) can achieve fine-grained access control over encrypted data, it still could not work for restricting unauthorised user to access. In this paper, we introduce a new cryptographic primitive called attribute-based encryption supporting data filtration (ABE-SDF), and formalise the security mode by incorporating the advantages into previous ABE. Finally, we present an efficient construction of the scheme over post-quantum assumptions our scheme is believed to be quantum-resistant owing to the special property of lattices. Based on the LWE assumption, we prove that the proposed scheme has the indistinguishability against selective chosen plaintext attacks and the authentication information security.