Dynamic Proofs of Retrievability Via Oblivious RAM

@article{Cash2012DynamicPO,
  title={Dynamic Proofs of Retrievability Via Oblivious RAM},
  author={David Cash and Alptekin K{\"u}pç{\"u} and Daniel Wichs},
  journal={Journal of Cryptology},
  year={2012},
  volume={30},
  pages={22-57}
}
Proofs of retrievability allow a client to store her data on a remote server (e.g., “in the cloud”) and periodically execute an efficient audit protocol to check that all of the data are being maintained correctly and can be recovered from the server. For efficiency, the computation and communication of the server and client during an audit protocol should be significantly smaller than reading/transmitting the data in its entirety. Although the server is only asked to access a few locations of… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 164 citations. REVIEW CITATIONS

3 Figures & Tables

Topics

Statistics

020402012201320142015201620172018
Citations per Year

164 Citations

Semantic Scholar estimates that this publication has 164 citations based on the available data.

See our FAQ for additional information.