Compact Proofs of Retrievability

The central challenge is to build systems that are both efficient and provably secure-that is, it should be possible to extract the client's data from any prover that passes a verification check. In this paper, the authors give the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski. The first scheme, built from BLS signatures and secure in the random oracle model, has the shortest query and response of any proof-of-retrievability with public verifiability.