Proofs of Retrievability (PoRs) are protocols which allow a client to store
data remotely and to efficiently ensure, via audits, that the entirety of that
data is still intact. A dynamic PoR system also supports efficient retrieval
and update of any small portion of the data. We propose new, simple protocols
for dynamic PoR that are designed for practical efficiency, trading decreased
persistent storage for increased server computation, and show in fact that this
tradeoff is inherent via a lower bound proof of time-space for any PoR scheme.
Notably, ours is the first dynamic PoR which does not require any special
encoding of the data stored on the server, meaning it can be trivially composed
with any database service or with existing techniques for encryption or
redundancy. Our implementation and deployment on Google Cloud Platform
demonstrates our solution is scalable: for example, auditing a 1TB file takes
just over 7 minutes and costs less than $0.12 USD. We also present several
further enhancements, reducing the amount of client storage, or the
communication bandwidth, or allowing *public verifiability*, wherein any
untrusted third party may conduct an audit.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Anthoine_G/0/1/0/all/0/1">Gaspard Anthoine</a> (CASC), <a href="http://arxiv.org/find/cs/1/au:+Dumas_J/0/1/0/all/0/1">Jean-Guillaume Dumas</a> (CASC), <a href="http://arxiv.org/find/cs/1/au:+Hanling_M/0/1/0/all/0/1">Michael Hanling</a>, <a href="http://arxiv.org/find/cs/1/au:+Jonghe_M/0/1/0/all/0/1">M&#xe9;lanie de Jonghe</a> (CASC), <a href="http://arxiv.org/find/cs/1/au:+Maignan_A/0/1/0/all/0/1">Aude Maignan</a> (CASC), <a href="http://arxiv.org/find/cs/1/au:+Pernet_C/0/1/0/all/0/1">Cl&#xe9;ment Pernet</a> (CASC), <a href="http://arxiv.org/find/cs/1/au:+Roche_D/0/1/0/all/0/1">Daniel Roche</a>

By admin