Cooperative provable data possession for integrity verification in multicloud storage

Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu

Research output: Contribution to journalArticlepeer-review

405 Scopus citations


Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients' data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy. We prove the security of our scheme based on multiprover zero-knowledge proof system, which can satisfy completeness, knowledge soundness, and zero-knowledge properties. In addition, we articulate performance optimization mechanisms for our scheme, and in particular present an efficient method for selecting optimal parameter values to minimize the computation costs of clients and storage service providers. Our experiments show that our solution introduces lower computation and communication overheads in comparison with noncooperative approaches.

Original languageEnglish (US)
Article number6152093
Pages (from-to)2231-2244
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number12
StatePublished - 2012


  • Storage security
  • cooperative
  • interactive protocol
  • multiple cloud
  • provable data possession
  • zero-knowledge

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Cooperative provable data possession for integrity verification in multicloud storage'. Together they form a unique fingerprint.

Cite this