International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Cooperative Provable Data Possession

Authors:
Yan Zhu
Huaixi Wang
Zexing Hu
Gail-Joon Ahn
Hongxin Hu
Stephen S. Yau
Download:
URL: http://eprint.iacr.org/2010/234
Search ePrint
Search Google
Abstract: Provable data possession (PDP) is a technique for ensuring the integrity of data in outsourcing storage service. In this paper, we address the construction of efficient PDP schemes on hybrid clouds to support scalability of service and data migration, in which we consider the existence of multiple cloud service providers (CSP) to cooperatively store and maintain the clients' data. The proposed PDP schemes include an interactive PDP (IPDP) and a cooperative PDP (CPDP) schemes adopting zero-knowledge property and three-layered index hierarchy, respectively. In particular, we present an efficient method for selecting the optimal number of sectors in each block to minimize the computation costs of clients and storage service providers. Our experiments show that the verification requires a small, constant amount of overhead, which minimizes communication complexity.
BibTeX
@misc{eprint-2010-23135,
  title={Cooperative Provable Data Possession},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / Storage Security, Provable Data Possession, Interactive Protocol, Zero-knowledge},
  url={http://eprint.iacr.org/2010/234},
  note={This report has been submitted into ACM CCS 2010 conference. yan.zhu@pku.edu.cn 14767 received 25 Apr 2010, last revised 6 Jun 2010},
  author={Yan Zhu and Huaixi Wang and Zexing Hu and Gail-Joon Ahn and Hongxin Hu and Stephen S. Yau},
  year=2010
}