Research Papers

Science China Information Sciences

, Volume 54, Issue 8, pp 1608-1617

Zero-knowledge proofs of retrievability

  • Yan ZhuAffiliated withInstitute of Computer Science and Technology, Peking UniversityBeijing Key Laboratory of Internet Security Technology, Peking University Email author 
  • , HuaiXi WangAffiliated withSchool of Mathematical Sciences, Peking University
  • , ZeXing HuAffiliated withInstitute of Computer Science and Technology, Peking University
  • , Gail-Joon AhnAffiliated withSchool of Computing, Informatics, and Decision Systems Engineering, Arizona State University
  • , HongXin HuAffiliated withSchool of Computing, Informatics, and Decision Systems Engineering, Arizona State University Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Keywords

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