Skip to Main content Skip to Navigation
Conference papers

Dynamic proofs of retrievability with low server storage

Abstract : 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 less than 5 minutes and costs less than $0.08 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.
Complete list of metadata
Contributor : Jean-Guillaume Dumas Connect in order to contact the contributor
Submitted on : Thursday, June 3, 2021 - 6:45:32 PM
Last modification on : Tuesday, October 19, 2021 - 11:25:52 AM


Files produced by the author(s)


  • HAL Id : hal-02875379, version 4
  • ARXIV : 2007.12556



Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, et al.. Dynamic proofs of retrievability with low server storage. 30th USENIX Security Symposium, Aug 2021, virtual event, United States. pp.537--554. ⟨hal-02875379v4⟩



Record views


Files downloads