30 Citations (Scopus)

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.

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

Fingerprint

Network protocols
Communication

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Zero-knowledge proofs of retrievability. / Zhu, Yan; Wang, HuaiXi; Hu, ZeXing; Ahn, Gail-Joon; Hu, HongXin.

In: Science China Information Sciences, Vol. 54, No. 8, 08.2011, p. 1608-1617.

Research output: Contribution to journalArticle

Zhu, Yan ; Wang, HuaiXi ; Hu, ZeXing ; Ahn, Gail-Joon ; Hu, HongXin. / Zero-knowledge proofs of retrievability. In: Science China Information Sciences. 2011 ; Vol. 54, No. 8. pp. 1608-1617.
@article{29af6cc2544d44f4855fa264b447b4c5,
title = "Zero-knowledge proofs of retrievability",
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, interactive protocol, proofs of retrievability, rewindable knowledge extractor, soundness, zero-knowledge",
author = "Yan Zhu and HuaiXi Wang and ZeXing Hu and Gail-Joon Ahn and HongXin Hu",
year = "2011",
month = "8",
doi = "10.1007/s11432-011-4293-9",
language = "English (US)",
volume = "54",
pages = "1608--1617",
journal = "Science China Information Sciences",
issn = "1674-733X",
publisher = "Science in China Press",
number = "8",

}

TY - JOUR

T1 - Zero-knowledge proofs of retrievability

AU - Zhu, Yan

AU - Wang, HuaiXi

AU - Hu, ZeXing

AU - Ahn, Gail-Joon

AU - Hu, HongXin

PY - 2011/8

Y1 - 2011/8

N2 - 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.

AB - 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.

KW - cryptography

KW - integrity of outsourced data

KW - interactive protocol

KW - proofs of retrievability

KW - rewindable knowledge extractor

KW - soundness

KW - zero-knowledge

UR - http://www.scopus.com/inward/record.url?scp=79960836433&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960836433&partnerID=8YFLogxK

U2 - 10.1007/s11432-011-4293-9

DO - 10.1007/s11432-011-4293-9

M3 - Article

VL - 54

SP - 1608

EP - 1617

JO - Science China Information Sciences

JF - Science China Information Sciences

SN - 1674-733X

IS - 8

ER -