The academic article discusses a novel ciphertext-policy attribute-based encryption (CP-ABE) scheme that introduces a flexible access structure. This scheme uses an access tree for its access control policy, providing fine-grained access control over encrypted data. The security of the scheme is based on the decisional Ring-Learning with Errors (R-LWE) problem, a known hardness assumption in cryptography. The scheme doesn’t rely on additional assumptions or idealized cryptographic primitives, making it practical for real-world deployment. The scheme’s performance and efficiency are validated through extensive simulations and comparisons with existing CP-ABE schemes. The results demonstrate the effectiveness and scalability of the proposed approach. The scheme offers enhanced access control capabilities, ensuring secure and customizable data access in practical scenarios.
Publication date: 26 Jan 2024
Project Page: ?
Paper: https://arxiv.org/pdf/2401.14076
