Publicly verifiable static proofs of storage: A novel scheme and efficiency comparisons

Abstract

Proofs of storage are cryptographic primitives that enable a storage provider to prove that it honestly stores files of its users without tampering or deleting parts of them. The performance of publicly verifiable proofs of storage is not well understood and is mostly measured asymptotically in the literature. We propose and implement a novel publicly verifiable static proof of storage based on the RSA assumption, measure its computational performance, and compare it to other state of the art schemes. In our performance evaluation, our scheme outperforms existing schemes with similar security guarantees in the time taken to encode the file. In the other metrics its runtime is comparable to that of existing schemes. We consider our scheme together with our practical evaluations to be an important contribution to the application of cloud storage security mechanisms.