A dynamic data access control scheme for hierarchical structures in big data

Abstract

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a promising solution to address the issues of data leakage and sharing in big data. When multiple files are shared, they often have hierarchical access relationships. However, existing hierarchical data CP-ABE schemes can only support simple hierarchical access structures. The limitation arises, necessitating the generation of multiple access structures to meet hierarchical access requirements, resulting in the wastage of computational and storage resources. Therefore, in this paper, we carefully design a dynamic hierarchy access control that allows its level nodes to flexibly participate in the decryption of other nodes, enabling the realization of complex hierarchical data relationships. Building upon this, we construct the Attribute-based Dynamic Hierarchical data Access Control (ADHAC) scheme, achieving efficient and dynamic access control for multiple datasets. Subsequently, we apply our scheme in distributed computing, which enables efficient access control for individuals and institutions over multiple data sets and fine-grained computation. Security analysis indicates that our scheme can resist chosen plaintext attack (CPA). Both theoretical and experimental analyses demonstrate that our scheme has impressive advantages in terms of computational efficiency and storage costs compared to existing schemes.