enhancing lattice-based attribute-based encryption with robust fine-grained access policies

Protecting sensitive data is crucial in various fields, including information technologies, network security, and healthcare records. implementing precise access policies for encrypted data is vital in large networks. attribute-based encryption (abe) emerges as a solution to this challenge, enabling encryption and access control simultaneously. with the increasing significance of quantum-safe measures due to advancements in quantum computing, there is a growing need for quantum-resistant access control mechanisms for encrypted data, as addressed by lattice-based attribute-based encryption.however, some existing lattice-based abe schemes lack robust support for fine-grained access policies. in this paper, we present an enhancement to a key policy attribute-based encryption (abe) scheme to not only accommodate threshold gates but also any boolean circuits. our proposed scheme’s security is grounded in the learning with errors (lwe) assumption within the selective security model under the indistinguishable cpa game. importantly, the scheme is well-suited for the disjunctive normal form (dnf) representation of boolean functions, offering enhanced flexibility and security in access control mechanisms for encrypted data.