Zero-knowledge proofs of retrievability

Yan Zhu, HuaiXi Wang, ZeXing Hu, Gail-Joon Ahn, HongXin Hu

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage services. In this paper, we address the construction of POR protocol on the standard model of interactive proof systems. We propose the first interactive POR scheme to prevent the fraudulence of prover and the leakage of verified data. We also give full proofs of soundness and zero-knowledge properties by constructing a polynomialtime rewindable knowledge extractor under the computational Diffie-Hellman assumption. In particular, the verification process of this scheme requires a low, constant amount of overhead, which minimizes communication complexity.

Original languageEnglish (US)
Pages (from-to)1608-1617
Number of pages10
JournalScience China Information Sciences
Issue number8
StatePublished - Aug 2011


  • cryptography
  • integrity of outsourced data
  • interactive protocol
  • proofs of retrievability
  • rewindable knowledge extractor
  • soundness
  • zero-knowledge

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Zero-knowledge proofs of retrievability'. Together they form a unique fingerprint.

Cite this