Efficient Proofs of Retrievability with Public Verifiability for Dynamic Cloud Storage

TL;DR

This paper introduces an efficient, publicly verifiable dynamic proof of retrievability scheme for cloud storage, ensuring data integrity and accessibility with reduced bandwidth, leveraging homomorphic hashing.

Contribution

It presents a novel dynamic POR scheme using homomorphic hashing that improves bandwidth efficiency over existing methods.

Findings

Scheme is more bandwidth-efficient than previous solutions.

Security analysis confirms data integrity and retrievability.

Performance evaluation demonstrates practical applicability.

Abstract

Cloud service providers offer various facilities to their clients. The clients with limited resources opt for some of these facilities. They can outsource their bulk data to the cloud server. The cloud server maintains these data in lieu of monetary benefits. However, a malicious cloud server might delete some of these data to save some space and offer this extra amount of storage to another client. Therefore, the client might not retrieve her file (or some portions of it) as often as needed. Proofs of retrievability (POR) provide an assurance to the client that the server is actually storing all of her data appropriately and they can be retrieved at any point of time. In a dynamic POR scheme, the client can update her data after she uploads them to the cloud server. Moreover, in publicly verifiable POR schemes, the client can delegate her auditing task to some third party specialized for this purpose. In this work, we exploit the homomorphic hashing technique to design a publicly verifiable dynamic POR scheme that is more efficient (in terms of bandwidth required between the client and the server) than the "state-of-the-art" publicly verifiable dynamic POR scheme. We also analyze security and performance of our scheme.