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.
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.
Ciphertext policy attribute-based encryption (CP-ABE) is a promising cryptographic technology that provides fine-grained access control as well as data confidentiality. It enables one sender to encrypt the data for more receivers, and to specify a policy on who can decrypt the ciphertext using his/her attributes alone. However, most existing ABE schemes are constructed on bilinear maps and they cannot resist quantum attacks. In this paper, we propose a multi-authority CP-ABE (MA-CPABE) scheme on ideal lattices which is still secure in post-quantum era. On one hand, multiple attribute authorities are required when user's attributes cannot be managed by a central authority. On the other hand, compared with generic lattice, the ideal lattice has extra algebraic structure and can be used to construct more efficient cryptographic applications. By adding some virtual attributes for each authority, our scheme can support flexible threshold access policy. Security analysis shows that the proposed scheme is secure against chosen plaintext attack (CPA) in the standard model under the ring learning with errors (R-LWE) assumption.
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.
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.
Lattice-based Attribute-based encryption is a well-known cryptographic mechanism that can resist quantum attacks and has the ability of fine-grained access control, and it has a wide range of application scenarios in current Internet of Thing (IoT) era. However, lack of efficiency and existing the problem of large ciphertext expansion rate are the main disadvantages impede the applications of this mechanism. Thus, we propose an efficient and practical ciphertext policy attribute-based encryption (CP-ABE) scheme from lattices in the paper. In this scheme, to make the secret key reusable, we adjust access tree and propose a basic access tree structure, which can be converted from disjunctive normal form, and combine it with a light post-quantum scheme of Kyber. In addition, the compression method and plaintext expansion method are introduced to optimize the scheme. Our CP-ABE scheme is secure against chosen plaintext attack under the hardness of module learning with errors problem. We implement our scheme and compare it with three recent related schemes in terms of security, function and communication cost. Experiments and comparisons show that our CP-ABE scheme has advantages in high encryption efficiency, small matrix dimension, small key sizes, and low ciphertext expansion rate, which has some merit in practice.
In Ciphertext Policy Attribute-Based Encryption (CP-ABE) system, a set of attributes is associated with the private keys of each user. Also, the ciphertext is attached with a policy which is defined over that set of attributes. A user can decrypt the ciphertext if the ciphertext’s policy is satisfied by the attributes associated hith her private key. Traditional CP-ABE schemes, based on number theoretic problems, rely on a trustworthy central authority. But in many distributed applications it is expected that such authorities should be decentralized to avoid the risks of single-point failure. While the number theory-based hardness problems are prone to quantum attacks, lattice-based hardness problems can resist such attacks. In this paper, we construct a Decentralized Ciphertext-Policy Attribute-Based Encryption (DCP-ABE) scheme. Under this scheme, any participating entity can act as an authority by creating a public key. The athority utilizes the users’ attributes to generate the private keys for them. Any user can encrypt data in terms of any monotone access structure over attributes issued from any chosen set of authorities. Hence the protocol does not depend on any central authority. We utilize Learning With Errors over Rings (R-LWE) as the underlying hardness assumption for te protocol. The proposed post-quantum protocol achieves security under selective-set model whereby adversaries are allowed to corrupt any authority only statically through adaptive key queries.
The energy and power industry faces increasing data security challenges amidst its digital transformation. Databases, as the foundation of digital infrastructure, require advanced encryption techniques to safeguard sensitive information. This paper proposes a novel encryption framework, QKD-ABE, that integrates Quantum Key Distribution (QKD) with Attribute-Based Encryption (ABE) to enhance the confidentiality, integrity, and access control of power system data. QKD enables unconditional security in key distribution by leveraging quantum mechanics, effectively preventing key interception and tampering. ABE provides fine-grained access control by enforcing encryption policies based on user attributes, ensuring that only authorized individuals can access private data. The proposed scheme also demonstrates strong resistance to common security threats, including man-in-the-middle and eavesdropping attacks, through quantum measurement disturbance and Quantum Bit Error Rate (QBerr) verification. Experimental results and theoretical analysis indicate that QKD-ABE offers a secure, efficient, and scalable solution for protecting sensitive data in modern smart grid environments.