z-logo
open-access-imgOpen Access
A Blockchain‐Based Flexible Data Auditing Scheme for the Cloud Service
Author(s) -
Kefeng FAN,
Fei LI,
Haiyang YU,
Zhen YANG
Publication year - 2021
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2021.08.011
Subject(s) - cloud computing , computer science , merkle tree , cloud storage , computer security , audit , scheme (mathematics) , bottleneck , service provider , cloud computing security , security analysis , data integrity , hash function , computer network , service (business) , accounting , hash chain , business , mathematics , mathematical analysis , marketing , embedded system , operating system
Nowdays, cloud storage technology has become a hot topic, and an increasing number of users are concerned with the security of their data in the cloud. Many auditing schemes on the cloud are proposed and the introduction of a third‐party auditor to assist users in verifying the integrity of cloud data. As a centralized node, the third‐party auditor has to communicate with all cloud users and cloud service providers, which becomes the bottleneck of the whole scheme. To solve this problem, we design a blockchain‐based flexible cloud data auditing scheme. In our scheme, a decentralized auditing framework is proposed to eliminate the dependency on the third‐party auditor, which increases the stability, security and performance of the whole scheme. Since the cloud service provider can automatically generates auditing proofs, our scheme can relieve the communication burdens of the cloud service provider. The proposed scheme also adapts the Merkle Hash tree to improve the verification performance. Security analysis and experiments show that the proposed scheme is secure and has better stability and verification efficiency.

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