Data Possession Protocol Research Articles

Comments on "An Efficient Identity-Based Provable Data Possession Protocol with Compressed Cloud Storage"

Comments on "An Efficient Identity-Based Provable Data Possession Protocol with Compressed Cloud Storage"

IntegrityChain: Provable Data Possession for Decentralized Storage

Outsourced storage enables data owners to host their data on remote storage resources without keeping a local copy so as to target their core business. However, a serious problem is data integrity in the sense that data owners lose their physical control over the remote-stored data. Existing provable data possession protocols are overwhelmingly designed for centralized storage such as cloud, in which the server is assumed dishonest but the client is reliable. Moreover, the centralized storage suffers single-point-of-failure threat. In this paper, to deal with these issues, we propose the notion of IntegrityChain, a decentralized storage framework supporting provable data possession (PDP) based on blockchain. We formalize the system model, in which a data owner can store files to the peers in a blockchain network and check the integrity of the outsourced data periodically by paying some cryptocurrencies while the hosts can earn money if honestly provide storage service and will be punished by losing the pre-made deposit if data loss happens. In the security model, we consider the fairness in trading between a host and a data user and the soundness of the underlying decentralized PDP in this system. We come up with a concrete construction by borrowing the idea of multi-replica PDP and proof-of-retrievability and present the security analysis of the proposal. The evaluation for the construction contain two segments: the offchain part, in which we implement the algorithms locally to test the time consumption, and onchain part, in which we program a smart contract and launch it in a test network to test the gas cost for the functions.

Security Analysis of a Certificateless Provable Data Possession Scheme in Cloud

He et al. proposed a certificateless provable data possession protocol for big data storage on cloud. They claimed that the scheme is not only secure, but also can achieve data integrity checking without downloading the stored data from the cloud server. However, in this paper, we show that He et al.'s protocol has some security flaw and cannot get the property of data integrity checking at all. Specifically, by observing certificateless signature used in their provable data possession protocol, we find that the cloud server (or any user who gets signature-message pairs) can generate a valid signature of any message. Then, the cloud server can tamper data stored by the data owner and successfully passes the data integrity checking via two different conditions according to the verifier knows or does not know the identity of blocks of data.

A novel provable data possession scheme based on geographic location attribute

Increment of mobile cloud video motivates mobile users to utilize cloud storage service to address their demands, cloud storage provider always furnish a location-independent platform for managing user's data. However, mobile users wonder if their cloud video data leakage or dynamic migration to illegal service providers. In this paper, we design a novel provable data possession protocol based on data geographic location attribute, which allows data owner to auditing the integrity of their video data, which put forward an ideal choice for remote data possession checking in the mobile cloud storage. In our proposed scheme, we check out whether the video data dynamic migrate to an unspecified location (such as: overseas) by adding data geographic location attribute tag into provable data possession protocol. Moreover, we make sure the security of our proposed scheme under the Computational Diffie-Hellman assumption. The analysis and experiment results demonstrate that our proposed scheme is provably secure and efficient.

Provable multiple replication data possession with full dynamics for secure cloud storage

SummaryCloud storage has been gaining tremendous popularity among individuals and corporations because of its low maintenance cost and on‐demand services for the clients. To improve the availability and the reliability of critical data, storing multiple replicas on multiple servers is a commonly used strategy. Currently, several provable data possession (PDP) protocols for multiple replicas of dynamic data have been proposed to ensure the integrity of outsourced multi‐copy data, but the efficiency of these protocols on verifying multiple replicas one by one is not satisfactory. In this paper, we propose a provable multiple replication data possession protocol with full dynamics, named MR‐DPDP. In MR‐DPDP, we utilize a novel authenticated data structure called Merkle hash tree with rank to support both full dynamic data updates and efficient integrity verification. In addition, our construction with RSA signature can support both variable‐sized file blocks and public verification. Through security proof and performance evaluation, we demonstrate that MR‐DPDP not only is sound but also incurs less communication overhead when updating data blocks as well as verifying a proof of the integrity of multiple replicas. Copyright © 2015 John Wiley & Sons, Ltd.

Robust Provable Data Possession Protocol

Provable data possession (PDP) is a technique for ensuring the validity of data in storage outsourcing. The main issue is how to frequently, efficiently verify that an untrusted server is correctly storing its client’s outsourced data. In this paper, we introduce a robust provable data possession protocol that allows a client that has stored he/her data at an untrusted server to verify the validity of data without retrieving it. The client preprocesses the data and sends it to an untrusted server for storage, while keeping a small amount of meta-data. Then the client generates probabilistic proofs of possession by sampling a random set of blocks from the server to prove that the stored data has not been tampered with or deleted, which drastically reduces I/O costs. In additions, by means of the careful integration of online codes and PDP (O-PDP), the scheme can recovers a small amount of the file, once it has been deleted. Finally, we conduct an experimental evaluation to study the performance, and robustness of O-PDP.