ISPEC 2017, 13th International Conference on Information Security Practice and Experience, 13-15 December 2017, Melbourne, Australia / Also in LNCS Vol. 10701
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.
Type:
Conference
City:
Melbourne
Date:
2017-12-13
Department:
Digital Security
Eurecom Ref:
5349
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in ISPEC 2017, 13th International Conference on Information Security Practice and Experience, 13-15 December 2017, Melbourne, Australia / Also in LNCS Vol. 10701 and is available at : http://doi.org/10.1007/978-3-319-72359-4_29
See also:
