Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy

TL;DR

This paper reviews a 2015 cloud data integrity scheme, highlights its security flaws, and proposes two improved, secure, and privacy-preserving constructions using hash-based data structures.

Contribution

It introduces two new secure and privacy-preserving dynamic provable data possession schemes based on existing models, utilizing Index Hash Tables and Merkle Hash Trees.

Findings

Both schemes are secure in the random oracle model.

They ensure data privacy during verification.

The schemes effectively detect data integrity issues.

Abstract

Cloud storage services have become accessible and used by everyone. Nevertheless, stored data are dependable on the behavior of the cloud servers, and losses and damages often occur. One solution is to regularly audit the cloud servers in order to check the integrity of the stored data. The Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy presented in ACISP'15 is a straightforward design of such solution. However, this scheme is threatened by several attacks. In this paper, we carefully recall the definition of this scheme as well as explain how its security is dramatically menaced. Moreover, we proposed two new constructions for Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy based on the scheme presented in ACISP'15, one using Index Hash Tables and one based on Merkle Hash Trees. We show that the two schemes are secure and privacy-preserving in the random oracle model.