Dynamic Provable Data Possession Based on Ranked Merkle Hash Tree

To move the application software and data into the cloud has become a trend. To prevent the data from being lost, modified and corrupted, the data integrity needs to be verified. The provable data possession (PDP) protocol is used to solve this problem. However, users often do some dynamic operations, such as insertion, modification and deletion, and it increases the difficulty and complexity of verification. How to construct the PDP scheme supporting dynamic updating of data becomes a hot research topic. The technology of hash aggregation is considered as one of the solutions to reduce costs of verification due to data dynamic operation. We analyze Wang et al.'s dynamic provable data possession (DPDP) solution and identify its security flaws during hash aggregation phase. This paper proposes an improved scheme to resolve security problem in Wang et al.'s scheme.