Open AccessComputer Science
H. Shacham, Brent Waters
2008.12.7JOURNAL OF CRYPTOLOGY
tlooto Summary
This paper gives the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski.
Abstract
Abstract is not available.
Citation format
SHACHAM, H.; WATERS, Brent. Compact proofs of retrievability. JOURNAL OF CRYPTOLOGY, 2008, 26: 442–483.