Proof of retrievability
A proof of retrievability is a storage-auditing protocol whose security model requires file extraction from a prover that succeeds sufficiently often in verification.
Shacham and Waters formalize an extractor and distinguish public verification from public extraction. Suitable erasure coding converts recovery of enough encoded blocks into recovery of the file. One accepted challenge is not itself a completed extraction. [1]
Hesela's operational synthesis: proof for a ciphertext object does not exercise decryption-key recovery, backup-version selection or application startup. Keep a separate restore test. [2]
Relations
- related
- provable-data-possession, proof-of-ownership, erasure-coding, restore-test, backup-verification
Citations
- Shacham and Waters. Compact Proofs of Retrievability. Journal of Cryptology (2013), section 2, Appendix A.
- Hesela: Encrypted deduplication, ownership proofs and remote storage audit boundaries
Published by Hesela team · Updated
Report a correction · Editorial standards · Reuse guidance
Cite this page
Hesela team. Proof of retrievability. Hesela. 2026-10-18. https://hesela.dev/terms/proof-of-retrievability/