MR-PDP: Multiple-Replica Provable Data Possession

Curtmola, Reza; Khan, Osama; Burns, Randal; Ateniese, Giuseppe

doi:10.1109/icdcs.2008.68

Cited by 365 publications

(209 citation statements)

References 18 publications

Supporting

Mentioning

208

Contrasting

Order By: Relevance

“…Multiple-Replica PDP (MR-PDP) technique was proposed by Curtmola [14] which allows the data owner to verify the replicas of the outsourced file available with the CSP.It is the enhanced version of the method that was originally proposed by Ateniese et al [3]. Pseudo-Random Function (PRF) was used to introduce some randomness in the replicas.…”

Section: Related Workmentioning

confidence: 99%

Secure provable data possession scheme with replication support in the cloud using Tweaks

Ali

Ramakrishnan

2017

Cluster Comput

View full text Add to dashboard Cite

Cloud computing is an emerging model in which computing facilities are provided as a service and accessed using Internet hence organizations prefer data outsourcing to the cloud servers. Currently, organizations produce a large amount of data and expect increased availability, scalability and security. When data is migrated to cloud, security and availability of the data must be verified since the critical data of the organizations lies outside the data owner premises. To enhance the availability of the data the data owners prefer replicating data to more than one cloud servers. Thus there will be pre-defined SLAs between the cloud service provider (CSP) and the data owners that include payment of fees measured in terms of GB per month for data replication. We need to have a protocol which ensures that the cloud service provider is replicating the data storage based on the pre defined SLAs. In this paper we propose a protocol called "Secure Provable Data Possession scheme with Replication support in the Cloud using Tweaks" that prevents the CSP cheating the data owner by maintaining fewer replicas than the agreed one in the SLAs and also supports dynamic data operations. We illustrate the performance of our scheme with experimental analysis and prove that it performs better than the existing systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure provable data possession scheme with replication support in the cloud using Tweaks

Ali

Ramakrishnan

2017

Cluster Comput

View full text Add to dashboard Cite

show abstract

“…One method to support availability and reliability is to store several copies of the file, resulting in better availability and efficiency. A first effort to use multi-copy paradigm was the MR-PDP (Multiple-Replica PDP) scheme proposed by Curtmola et al [14] that extends the (single-copy) PDP. MR-PDP enables a client to store t replicas of a file in a storage system, and to verify through a challenge-response protocol that each unique replica is accessible.…”

Section: Related Workmentioning

confidence: 99%

Transparent, Distributed, and Replicated Dynamic Provable Data Possession

Etemad

Küpçü

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

With the growing trend toward using outsourced storage, the problem of efficiently checking and proving data integrity needs more consideration. Starting with PDP and POR schemes in 2007, many cryptography and security researchers have addressed the problem. After the first solutions for static data, dynamic versions were developed (e.g., DPDP). Researchers also considered distributed versions of such schemes. Alas, in all such distributed schemes, the client needs to be aware of the structure of the cloud, and possibly pre-process the file accordingly, even though the security guarantees in the real world are not improved.We propose a distributed and replicated DPDP which is transparent from the client's viewpoint. It allows for real scenarios where the cloud storage provider (CSP) may hide its internal structure from the client, flexibly manage its resources, while still providing provable service to the client. The CSP decides on how many and which servers will store the data. Since the load is distributed on multiple servers, we observe one-to-two orders of magnitude better performance in our tests, while availability and reliability are also improved via replication. In addition, we use persistent rank-based authenticated skip lists to create centralized and distributed variants of a dynamic version control system with optimal complexity.

show abstract

“…Another scheme based on polynomial commitments for public verifiability has been introduced in [27]. There are also constructions for a distributed storage setting, that is, considering multiple storage servers [12,29]. The original PDP setting applies only to static (or append-only) files or only supports limited updates with a bounded number of challenges [4].…”

Section: Related Workmentioning

confidence: 99%

Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves

Hanser

Slamanig

2013

Proceedings of the 10th International Conference on Security and Cryptography

View full text Add to dashboard Cite

Abstract. When outsourcing large sets of data to the cloud, it is desirable for clients to efficiently check, whether all outsourced data is still retrievable at any later point in time without requiring to download all of it. Provable data possession (PDP)/proofs of retrievability (PoR), for which various constructions exist, are concepts to solve this issue. Interestingly, by now, no PDP/PoR scheme leading to an efficient construction supporting both private and public verifiability simultaneously is known. In particular, this means that up to now all PDP/PoR schemes either allow public or private verifiability exclusively, since different setup procedures and metadata sets are required. However, supporting both variants simultaneously seems interesting, as publicly verifiable schemes are far less efficient than privately verifiable ones. In this paper, we propose the first simultaneous privately and publicly verifiable (robust) PDP protocol, which allows the data owner to use the more efficient private verification and anyone else to run the public verification algorithm. Our construction, which is based on elliptic curves, achieves this, as it uses the same setup procedure and the same metadata set for private and public verifiability. We provide a rigorous security analysis and prove our construction secure in the random oracle model under the assumption that the elliptic curve discrete logarithm problem is intractable. We give detailed comparisons with the most efficient existing approaches for either private or public verifiability with our proposed scheme in terms of storage and communication overhead, as well as computational effort for the client and the server. Our analysis shows that for choices of parameters, which are relevant for practical applications, our construction outperforms all existing privately and publicly verifiable schemes significantly. This means, that even when our construction is used for either private or public verifiability alone, it still outperforms the most efficient constructions known, which is particularly appealing in the public verifiability setting.

show abstract

MR-PDP: Multiple-Replica Provable Data Possession

Cited by 365 publications

References 18 publications

Secure provable data possession scheme with replication support in the cloud using Tweaks

Secure provable data possession scheme with replication support in the cloud using Tweaks

Transparent, Distributed, and Replicated Dynamic Provable Data Possession

Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves

Contact Info

Product

Resources

About