Identity-Based Distributed Provable Data Possession in Multicloud Storage
Remote data integrity checking is of crucial importance in cloud storage. It can make the clients verify whether their outsourced data is kept intact without downloading the whole data. In some application scenarios, the clients have to store their data on multicloud servers. At the same time, the integrity checking protocol must be efficient in order to save the verifier’s cost. From the two points, we propose a novel remote data integrity checking model: ID-DPDP (identity-based distributed provable data possession) in multicloud storage. The formal system model and security model are given. Based on the bilinear pairings, a concrete ID-DPDP protocol is designed. The proposed ID-DPDP protocol is provably secure under the hardness assumption of the standard CDH (computational Diffie-Hellman) problem. In addition to the structural advantage of elimination of certificate management, our ID-DPDP protocol is also efficient and flexible. Based on the client’s authorization, the proposed ID-DPDP protocol can realize private verification, delegated verification, and public verification.
Provable data possession (PDP) paradigm was proposed by Ateniese et al. In the PDP model, the verifier can check remote data integrity with a high probability. Based on the RSA, they designed two provably secure PDP schemes.
Ateniese et al. proposed dynamic PDP model and concrete scheme although it does not support insert operation.
In order to support the insert operation, in 2009, Erway et al. proposed a full-dynamic PDP scheme based on the authenticated flip table. The similar work has also been done by F. Sebe´ et al. PDP allows a verifier to verify the remote data integrity without retrieving or downloading the whole data. It is a probabilistic proof of possession by sampling random set of blocks from the server, which drastically reduces I/O costs. The verifier only maintains small metadata to perform the integrity checking. PDP is an interesting remote data integrity checking model.
DISADVANTAGES OF EXISTING SYSTEM:
It does not support insert operation.
Drastically reduces I/O costs.
In identity-based public key cryptography, this paper focuses on distributed provable data possession in multi-cloud storage. The protocol can be made efficient by eliminating the certificate management.
We propose the new remote data integrity checking model: ID-DPDP. The system model and security model are formally proposed. Then, based on the bilinear pairings, the concrete ID-DPDP protocol is designed. In the random oracle model, our IDDPDP protocol is provably secure. On the other hand, our protocol is more flexible besides the high efficiency.
Based on the client’s authorization, the proposed ID-DPDP protocol can realize private verification, delegated verification and public verification.
ADVANTAGES OF PROPOSED SYSTEM:
Our protocol does not suffer from resource-consuming certificate management which is required by the other existing protocols.
Our proposed ID-DPDP protocol satisfies the private verification and public verification.
System : Pentium IV 2.4 GHz.
Hard Disk : 40 GB.
Floppy Drive : 44 Mb.
Monitor : 15 VGA Colour.
Ram : 512 Mb.
Operating system : Windows XP/7.
Coding Language : net, C#.net
Tool : Visual Studio 2010
Database : SQL SERVER 2008
Huaqun Wang, “Identity-Based Distributed Provable Data Possession in Multicloud Storage”, IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 2, MARCH-APRIL 2015.