Cooperative Provable Data Possession Research Articles

Ensuring Data Integrity Using Cooperative Provable Data Possession for Multi Cloud Environment

Cloud computing is a new and fast growing technology that offers an innovative, efficient and scalable business model for organizations. Cloud computing is type of computing where resources are shared rather than having local servers or personal devices to handle various applications. Cloud computing is a type of internet based computing where different services like server, storage, application, and network are delivered to the organizations. Although almost every business organization is going to adopt this technology due to its various advantages. When cloud computing become more perfect organizations and user will store enormous amount of data on remote cloud storage to achieve remote access, reduced cost, data collection and sharing of other services. To access services from cloud user can have account associated with single and multiple cloud service providers (SPs). Important aspect for cloud computing environment is to maintain integrity of stored data. Implementation of encryption of the information is done in such a way that it will be impossible for the attackers to read the resources sent on the web. Advanced Encryption Standard (AES) and Elliptic Curve Cryptography (ECC) are the methods used for the encryption. Result will be text (cipher) which is decrypted on the receiver’s side. AES and ECC algorithm implemented together to provide sound security.

Survey of Integrity Verification in Multi-Cloud Storage by Efficient Cooperative Provable Data Possession

Provable data possession (PDP) is one of the techniques to ensure the integrity of data in storage outsourcing. Here in this paper, we speak to the creation of an efficient PDP method for distributed cloud storage to maintain the scalability of service and data migration. On the basis on homomorphic verifiable response and hash index hierarchy we projected a cooperative PDP (CPDP) method. We confirm the security of our method based on multi-prover zero- knowledge proof scheme, which can satisfy knowledge soundness, fullness , and zero-knowledge properties. As well, we expressive performance optimization mechanisms for our method, and in particular present an capable method for selecting finest parameter values to reduce the addition expenses of storage service providers and client. Our experiment shows that our solution introduces lower addition and communication overheads in evaluation with non- cooperative approaches. KeywordsData Migration, Homomorphic, Multi-Prover

On the Knowledge Soundness of a Cooperative Provable Data Possession Scheme in Multicloud Storage

Provable data possession (PDP) is a probabilistic proof technique for cloud service providers (CSPs) to prove the clients' data integrity without downloading the whole data. In 2012, Zhu et al. proposed the construction of an efficient PDP scheme for multicloud storage. They studied the existence of multiple CSPs to cooperatively store and maintain the clients' data. Then, based on homomorphic verifiable response and hash index hierarchy, they presented a cooperative PDP (CPDP) scheme from the bilinear pairings. They claimed that their scheme satisfied the security property of knowledge soundness. It is regretful that this comment shows that any malicious CSP or the malicious organizer (O) can generate the valid response which can pass the verification even if they have deleted all the stored data, i.e., Zhu et al.'s CPDP scheme cannot satisfy the property of knowledge soundness. Then, we discuss the origin and severity of the security flaws. It implies that the attacker can get the pay without storing the clients' data. It is important to clarify the scientific fact to design more secure and practical CPDP scheme in Zhu et al.'s system architecture and security model.

CPDP Scheme to Provide Data Integrity in Multicloud

Nowadays, Cloud storage service is a faster profit growth point by providing a position-independent, low -cost platform, comparably scalable for client’s data. The construction of cloud computing environment is based on interfaces and open architecture. It has cloud capable to include multiple internal and external cloud services together to provide high interoperability there can be multiple accounts associated with a single or multiple service providers. so, Security in terms of integrity is main and most important aspect in cloud computing environment. Cooperative Provable data possession (CPDP) is a method for integrity the ensuring of data in storage outsourcing. Therefore, we address the construction of an efficient dynamic audit service and CPDP scheme for distributed cloud storage as well verifying the integrity guarantee of an entrusted and outsourced storage which support the data migration and scalability of service.

Advanced Cooperative Provable Data Possession based Data Integrity Verification for Multi-Cloud Storage

Cloud computing is an emerging field which is raising its importance in the field of storage of data. Every individual, firm or organization wants to store data that has the limited storage capacity. For that purpose, there is need to outsource data to some Cloud Service Provider, there arises a problem of security of data. Security comes with 3 main parameters confidentiality, integrity and availability. For these issues, there is term called Provable Data Possession, it is nothing but the proof given by service provider to the data owner when there is demand by owner. Paper proposes an effective PDP model for integrity verification of data on distributed multicloud storage by using web-servers and Trusted Third Party. Here proposed the use of techniques such as, Advanced Cooperative Provable Data Possession (Advanced CPDP), Homomorphic Verifiable Response and Hash Index Hierarchy for Multiprover Zero Knowledge Proof System which is an Interactive Proof System. General Terms Security, Data Integrity on multi cloud

Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage

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.