z-logo
open-access-imgOpen Access
A Hierarchical Multi-Authority Access Control Scheme for Secure and Efficient Data Sharing in Cloud Storage
Author(s) -
Smita Athanere,
Ramesh Thakur
Publication year - 2022
Publication title -
journal of strategic security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.156
H-Index - 8
eISSN - 1944-0472
pISSN - 1944-0464
DOI - 10.5038/1944-0472.15.1.1970
Subject(s) - computer science , revocation , cloud computing , overhead (engineering) , access control , cloud storage , data sharing , computer security , encryption , cryptography , scheme (mathematics) , data security , key (lock) , computer network , distributed computing , medicine , mathematical analysis , alternative medicine , mathematics , pathology , operating system
Enterprises choose to keep their data on the cloud to allow for flexible and efficient data exchange among their authorized staff when dealing with huge data. However, during the sharing of sensitive data, data security and users privacy has become major challenges. Most of the existing studies have several limitations, including weak model security, single point of failure, and lack of efficiency during user revocation. This article proposes cloud storage based Hierarchical Multi-authority Access Control Scheme (HMA-ACS) for secure and efficient data sharing. Through theoretical analysis, this article proves that the proposed mechanism efficiently performs cryptographic key operations and secured plus adaptive in the standard model while supporting the access policies. Furthermore, the proposed approach evaluated and compared recent state-of-art schemes in terms of storage overhead, computation overhead, average encryption, and decryption performance. Experimental results analysis shows that the proposed solution is resistant to many types of security threats and ensures data privacy when sharing data in the cloud.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here