Science China Information Sciences

, 54:1608

Zero-knowledge proofs of retrievability

Research Papers

DOI: 10.1007/s11432-011-4293-9

Cite this article as:
Zhu, Y., Wang, H., Hu, Z. et al. Sci. China Inf. Sci. (2011) 54: 1608. doi:10.1007/s11432-011-4293-9

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

cryptographyintegrity of outsourced dataproofs of retrievabilityinteractive protocolzero-knowledgesoundnessrewindable knowledge extractor

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Institute of Computer Science and TechnologyPeking UniversityBeijingChina
  2. 2.Beijing Key Laboratory of Internet Security TechnologyPeking UniversityBeijingChina
  3. 3.School of Mathematical SciencesPeking UniversityBeijingChina
  4. 4.School of Computing, Informatics, and Decision Systems EngineeringArizona State UniversityTempeUSA