Compact Proofs of Retrievability

By Hovav Shacham and Brent Waters.

J. Cryptology, 26(3):442–83, Jul. 2013.


In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client’s data. 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, we give the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski.

Our first scheme, built from BLS signatures and secure in the random oracle model, features a proof-of-retrievability protocol in which the client’s query and server’s response are both extremely short. This scheme allows public verifiability: anyone can act as a verifier, not just the file owner. Our second scheme, which builds on pseudorandom functions (PRFs) and is secure in the standard model, allows only private verification. It features a proof-of-retrievability protocol with an even shorter server’s response than our first scheme, but the client's query is long. Both schemes rely on homomorphic properties to aggregate a proof into one small authenticator value.



@Article{SW13, author = {Hovav Shacham and Brent Waters}, title = {Compact Proofs of Retrievability}, journal = {J. Cryptology}, year = 2013, volume = 26, number = 3, pages = {442-83}, month = jul }

Navigation: Hovav Shacham // Publications // [SW13]