View article

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 …