Skip to main content
placeholder image

Dynamic provable data possession protocols with public verifiability and data privacy

Journal Article


Abstract


  • © 2017, Springer International Publishing AG. 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.

Publication Date


  • 2017

Citation


  • Gritti, C., Chen, R., Susilo, W. & Plantard, T. (2017). Dynamic provable data possession protocols with public verifiability and data privacy. Lecture Notes in Artificial Intelligence, 10701 485-505. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Scopus Eid


  • 2-s2.0-85038085121

Number Of Pages


  • 20

Start Page


  • 485

End Page


  • 505

Volume


  • 10701

Place Of Publication


  • Germany

Abstract


  • © 2017, Springer International Publishing AG. 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.

Publication Date


  • 2017

Citation


  • Gritti, C., Chen, R., Susilo, W. & Plantard, T. (2017). Dynamic provable data possession protocols with public verifiability and data privacy. Lecture Notes in Artificial Intelligence, 10701 485-505. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Scopus Eid


  • 2-s2.0-85038085121

Number Of Pages


  • 20

Start Page


  • 485

End Page


  • 505

Volume


  • 10701

Place Of Publication


  • Germany