Proofs of retrievability with public verifiability and constant communication cost in cloud

Jiawei Yuan, Shucheng Yu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

119 Scopus citations

Abstract

For data storage outsourcing services, it is important to allow data owners to efficiently and securely verify that the storage server stores their data correctly. To address this issue, several proof-of-retrievability (POR) schemes have been proposed wherein a storage server must prove to a verifier that all of a client's data are stored correctly. While existing POR schemes offer decent solutions addressing various practical issues, they either have a non-trivial (linear or quadratic) communication complexity, or only support private verification, i.e., only the data owner can verify the remotely stored data. It remains open to design a POR scheme that achieves both public verifiability and constant communication cost simultaneously. In this paper, we solve this open problem and propose the first POR scheme with public verifiability and constant communication cost: in our proposed scheme, the message exchanged between the prover and verifier is composed of a constant number of group elements; different from existing private POR constructions, our scheme allows public verification and releases the data owners from the burden of staying online. We achieved these by tailoring and uniquely combining techniques such as constant size polynomial commitment and homomorphic linear authenticators. Thorough analysis shows that our proposed scheme is efficient and practical. We prove the security of our scheme based on the Computational Diffie-Hellman Problem, the Strong Diffie-Hellman assumption and the Bilinear Strong Diffie-Hellman assumption.

Original languageEnglish
Title of host publicationCloud Computing 2013 - Proceedings of the 2013 International Workshop on Security in Cloud Computing
Pages19-26
Number of pages8
DOIs
StatePublished - 2013
Event2013 1st International Workshop on Security in Cloud Computing, Cloud Computing 2013 - Hangzhou, China
Duration: 8 May 20138 May 2013

Publication series

NameCloud Computing 2013 - Proceedings of the 2013 International Workshop on Security in Cloud Computing

Conference

Conference2013 1st International Workshop on Security in Cloud Computing, Cloud Computing 2013
Country/TerritoryChina
CityHangzhou
Period8/05/138/05/13

Keywords

  • cloud storage
  • constant communication
  • integrity check
  • polynomial commitment
  • proofs of retrievability
  • public verification

Fingerprint

Dive into the research topics of 'Proofs of retrievability with public verifiability and constant communication cost in cloud'. Together they form a unique fingerprint.

Cite this