Comments on a dynamic cloud data integrity verification scheme: security analysis and improvement Online publication date: Tue, 20-Jun-2023
by Hao Yan; Zheng Zhang; Yanan Liu; Shuo Qiu; Qiuling Wu
International Journal of Security and Networks (IJSN), Vol. 18, No. 2, 2023
Abstract: To ensure the integrity and reliability of the data on cloud servers, many public data verification schemes have been presented to allow data auditors to remotely audit the data integrity without fetching the data back. Recently, Zhao et al. (2021) proposed a dynamic data integrity audition scheme for cloud computing based on the dynamic array multi-branch tree (MBT). In their scheme, each leaf node x stores a hash value H(x) which relates to all the hash values of blocks in its block array. Because the value H(x) is always used to generate the integrity proof when any block linked to x is challenged, the attacker can deceive the auditor by replacing the challenged block with another one in the same block array. To address this problem of Zhao's scheme, we add a new index i for each block in the block array, which can ensure the uniqueness of each block to resist the replacement attack. Moreover, the algorithms of label generation and proof verification in Zhao's scheme are also upgraded to keep the soundness of the scheme. We give the security proof of the new scheme and make comprehensive performance analyses showing that compared with the original algorithms in Zhao's scheme, only negligible costs such as hash are brought to the new ones.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com