Identity-based Provable Data 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"

Identity-based Provable Data Possession for Multicloud Storage with Parallel Key-Insulation

Identity-based Provable Data Possession for Multicloud Storage with Parallel Key-Insulation

Identity-Based Provable Data Possession From RSA Assumption for Secure Cloud Storage

As cloud storage services have become popular nowadays, the integrity of outsourced data stored at untrusted servers received increased attention. Provable data possession (PDP) provides an effective and efficient solution for cloud data integrity by asking the cloud server to prove that the stored data are not tampered with or maliciously discarded without returning the actual data to users. In this article, we propose an efficient identity-based privacy-preserving provable data possession scheme (ID-P <inline-formula><tex-math notation="LaTeX">$^3$</tex-math></inline-formula> DP) based on the RSA assumption for secure cloud storage. In ID-P <inline-formula><tex-math notation="LaTeX">$^3$</tex-math></inline-formula> DP, a cloud user takes the outsourcing file and a global parameter in a time period as inputs to generate identity-based homomorphic authenticators, and any third-party auditor (TPA) can check the integrity of the outsourced file by verifying the validity of homomorphic authenticators. The distinguished feature of ID-P <inline-formula><tex-math notation="LaTeX">$^3$</tex-math></inline-formula> DP is to support the aggregation of identity-based homomorphic authenticators generated by different users under the RSA assumption, which is an open problem in provable data possession. Specifically, we transfer the identity-based homomorphic authenticators generated in distinct time periods into those with the same period parameter, and the cloud can compress the homomorphic authenticators of different users to generate a data possession proof for integrity verification. Besides, by exploiting zero-knowledge proof, the leakage of outsourced data to TPA can be prevented. The soundness of ID-P <inline-formula><tex-math notation="LaTeX">$^3$</tex-math></inline-formula> DP is proved based on the RSA assumption, and the privacy against TPA is perfectly preserved. Finally, we demonstrate ID-P <inline-formula><tex-math notation="LaTeX">$^3$</tex-math></inline-formula> DP is more efficient on integrity verification than the existing BLS-based schemes, and cross-user aggregate verification can significantly reduce computational and communication overhead for TPA.

A lightweight identity-based provable data possession supporting users’ identity privacy and traceability

Cloud storage auditing is considered as a significant service used to verify the integrity of data stored in public cloud. However, most existing auditing protocols suffer form complex certificate management/verification since they rely on expensive Public Key Infrastructure (PKI). On the other hand, most cloud users have constrained computational resources. The few existing ID-based storage auditing protocols in the literature, require resource-constrained users to perform costly operations for generating metadata on file blocks. In this paper, we propose a storage auditing protocol which benefits from ID-based structure and lightweight user computations, simultaneously. Our construction keeps user’s identity private from the server and TPA and also provides traceablity of misbehaving users. Our mechanism is also extended to support batch auditing of multiple tasks in multi-user setting. Performance evaluations demonstrate excellent efficiency of our scheme specially at the user’s side in comparison with the state of the art.

Identity-Based Public Auditing Scheme for Cloud Storage with Strong Key-Exposure Resilience

Secured storage system is a critical component in cloud computing. Cloud clients use cloud auditing schemes to verify the integrity of data stored in the cloud. But with the exposure of the auditing secret key to the Cloud Service Provider, cloud auditing becomes unsuccessful, however strong the auditing schemes may be. Therefore, it is essential to prevent the exposure of auditing secret keys, and even if it happens, it is necessary to minimize the damage caused. The existing cloud auditing schemes that are strongly resilient to key exposure are based on Public Key Infrastructure and so have challenges of certificate management/verification. These schemes also incur high computation time during integrity verification of the data blocks. The Identity-based schemes eliminate the usage of certificates but limit the damage due to key exposure, only in time periods earlier to the time period of the exposed key. Some of the key exposure resilient schemes do not provide support for batch auditing. In this paper, an Identity-based Provable Data Possession scheme is proposed. It protects the security of Identity-based cloud storage auditing in time periods both earlier and later to the time period of the exposed key. It also provides support for batch auditing. Analysis shows that the proposed scheme is resistant to the replace attack of the Cloud Service Provider, preserves the data privacy against the Third Party Auditor, and can efficiently verify the correctness of data.

Analysis of the comments on “Identity-Based Distributed Provable Data Possession in Multicloud Storage”

In 2016, Peng et al. pointed out in the literature (IEEE Transactions on Services Computing, Vol. 9, No. 6, pp. 996-998, Nov./Dec. 2016) that Wang's identity-based provable data possessing scheme ID-DPDP(IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) has security vulnerability, and Peng et al. offered the remedy solutions. Unfortunately, we demonstrate that Peng et al.'s method also has a security loophole that malicious cloud servers can produce valid proof information without original data. Accordingly, we provide a revised solution to the problem while preserving the security features of the ID-DPDP.

Efficient Privacy-Preserving Certificateless Provable Data Possession Scheme for Cloud Storage

Cloud computing is a burgeoning paradigm that offers reliable and adaptive infrastructure to the data owner who shares his data with the data user through the cloud server. In the data sharing process, the integrity of the data stored in the cloud faces serious threats. The provable data possession schemes ensure that a cloud server provider proves to a third party auditor that it is truthfully storing data from the data owner. However, the PKI-based provable data possession scheme suffers the management issue of the certificates and the identity-based provable data possession scheme causes an inherent key escrow problem. In this paper, we put forward an efficient privacy-preserving certificateless provable data possession scheme based on certificateless cryptography and elliptic curve cryptography, which has been proved to be unforgeable against adaptive chosen message attacks in the random oracle model. At the same time, the data integrity can be audited by the third party auditor without downloading the whole data. The proposed scheme gives away no information of the stored data to the third party auditor during the audit phase and the data owner's identity privacy is protected. The experiment results show that the proposed scheme is of efficiency and feasibility as far as computation and communication costs are concerned.

Identity-Based Batch Provable Data Possession with Detailed Analyses

In the era of big data, cloud storages become prevalent while security issues on outsourced data emerge. Without the physical control of the data owners, the outsourced data faces more risks. Provable Data Possession (PDP) is a probabilistic technique for checking whether data is correctly stored in remote servers without retrieving the entire data. For many previous PDP schemes, correctly choosing public keys for data owners relies on the security of Public Key Infrastructure (PKI), which is resource consuming. In this paper, we propose an Identity-Based Batch Provable Data Possession (ID-BPDP) scheme to eliminate the certificate management. Meanwhile, to the best of our knowledge, it is the first identity-based provable data possession scheme supporting batch verification for multiple owners and multiple clouds simultaneously to reduce computation cost greatly. We prove that our scheme is correct and secure based on bilinear pairings and the hardness assumption of Computational Diffie-Hellman problem, and also give detailed analyses to show that our scheme is able to verify the integrity of data efficiently.

Comments on “Identity-Based Distributed Provable Data Possession in Multicloud Storage”

In 2015, Wang proposed the first identity-based provable data possession scheme named ID-DPDP ( IEEE Transactions on Services Computing , vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) to verify outsourced data publicly without the implementation of PKI. Unfortunately, in this letter, we demonstrate that this scheme is insecure in the sense that cloud servers can generate valid proofs without possessing the original data blocks. We also show another security issue in this scheme which leads to some data blocks can never be verified unless all the data blocks are challenged. Meanwhile, we provide solutions to these problems while preserving the security features of the original scheme.

Identity-based provable data possession revisited: Security analysis and generic construction

Provable Data Possession (PDP), which enables cloud users to verify the data integrity without retrieving the entire file, is highly essential for cloud storage. Observing all the existing PDP schemes rely on the Public Key Infrastructure (PKI), Wang proposed an identity-based distributed provable data possession (ID-DPDP) scheme that can (1) eliminate the complex certificate management and (2) be applied to the multi-cloud scenario. The scheme is efficient, flexible and supports private verification, delegated verification and public verification. In this paper, we find that ID-DPDP is flawed since it fails to achieve soundness. We then fix the flaw by presenting a generic construction for identity-based PDP (ID-PDP) protocol, derived from secure digital signature schemes and traditional PDP protocols. We prove that the soundness of the generic ID-PDP construction depends on the security of the underlying PDP protocols and the signature schemes. An instance of the generic construction by utilizing a state-of-the-art PDP protocol due to Shacham and Waters and BLS short signature scheme is given. Moreover, a new ID-DPDP protocol is obtained by extending the basic ID-PDP to multiple clouds environment. The implementation shows that the proposed ID-PDP protocol is efficient.