Dynamic provable data possession

@article{Erway2008DynamicPD,
  title={Dynamic provable data possession},
  author={C. Erway and Alptekin K{\"u}pç{\"u} and Charalampos Papamanthou and R. Tamassia},
  journal={IACR Cryptol. ePrint Arch.},
  year={2008},
  volume={2008},
  pages={432}
}
We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We… Expand

Figures and Tables from this paper

New directions for remote data integrity checking of cloud storage
Cooperative Set Homomorphic Proofs for Data Possession Checking in Clouds
An Efficient and Secure Data Integrity Auditing Scheme with Traceability for Cloud-Based EMR
Dynamic Outsourced Auditing Services for Cloud Storage Based on Batch-Leaves-Authenticated Merkle Hash Tree
Efficient Proofs of Retrievability with Public Verifiability for Dynamic Cloud Storage
Generic Dynamic Data Outsourcing Framework for Integrity Verification
RDPC: Secure Cloud Storage with Deduplication Technique
Supporting Efficient Dynamic Update in Public Integrity Verification of Cloud Data
  • Jia Wan, Shijie Jia, Limin Liu, Yang Zhang
  • Computer Science
  • 2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)
  • 2020
Privacy-preserving TPA Auditing Scheme Based on Skip List for Cloud Storage
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
How Efficient Can Memory Checking Be?
Scalable and efficient provable data possession
Provable data possession at untrusted stores
Proofs of Retrievability via Hardness Amplification