and takes polynomial time. This paper describes a systematic method for transforming programs written as straightforward recursions into programs that use dynamic programming. The method extends the original program to cache all possibly computed values, incrementalizes the extended program with respect to...
Recent work in proofs of storage mainly deals with privately verifiable proofs of storage since these use symmetric cryptography and thus are faster than publicly verifiable proofs of storage. Another line of work is to extend the features of proofs of storage.Dynamicproofs of storage allow for upd...