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 will talk about a new kind of simple protocols for dynamic PoR based on linear algebra. This protocols are designed for practical efficiency, trading decreased persistent storage for increased server computation. Notably, ours is the first dynamic PoR which does not require any special encoding of the data stored on the server. I will also present a variant of the protocol that allows public verifiability, wherein any untrusted third party may conduct an audit.