Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage

projects 2012

Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage – projects 2012
projects 2012, Parallel and Distributed Systems, Pre-Print -2012

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 multi-prover 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 non-cooperative approaches

Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage – projects 2012
projects 2012, Parallel and Distributed Systems, Pre-Print -2012

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 multi-prover 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 non-cooperative approaches

2 Thoughts to “Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage”

  1. Bhaskar

    please send me a source code of project COOPERATIVE PROVABLE DATA POSSESSION FOR INTEGRITY VERIFICATION IN MULTI-CLOUD STORAGE

  2. Gowtham

    Please send me full source code for cooperative provable data possession for integrity verification in multi-cloud storage

Leave a Reply