Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
From MaRDI portal
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.
Recommendations
- Efficient dynamic provable data possession with public verifiability and data privacy
- Efficient dynamic provable data possession from dynamic binary tree
- A provable data possession scheme with data hierarchy in cloud
- Provably Secure Identity Based Provable Data Possession
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud
Cites work
- Compact Proofs of Retrievability
- Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
- Efficient dynamic provable data possession with public verifiability and data privacy
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- MuR-DPA: Top-Down Levelled Multi-Replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud
- Privacy-Preserving Public Auditing for Secure Cloud Storage
Cited in
(18)- A position-aware Merkle tree for dynamic cloud data integrity verification
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud
- Publicly verifiable data transfer and deletion scheme for cloud storage
- Publicly verifiable static proofs of storage: a novel scheme and efficiency comparisons
- An alternative approach to public cloud data auditing supporting data dynamics
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud, revisited
- Efficient dynamic provable data possession from dynamic binary tree
- Identity-Based Batch Provable Data Possession
- LBT-based cloud data integrity verification scheme
- Efficient dynamic provable data possession with public verifiability and data privacy
- Provably Secure Identity Based Provable Data Possession
- Identity-Based Batch Provable Data Possession with Detailed Analyses
- Security analysis on a remote data auditing scheme for distributed storage systems
- Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
- Proxy provable data possession with general access structure in public clouds
- A provable data possession scheme with data hierarchy in cloud
- Keyword-Based Delegable Proofs of Storage
- Cloud data auditing with designated verifier
This page was built for publication: Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056036)