Paper 2016/265
Multi-prover Proof-of-Retrievability
Maura B. Paterson, Douglas R. Stinson, and Jalaj Upadhyay
Abstract
There has been considerable recent interest in ``cloud storage'' wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actually storing the file, and typically a challenge-response protocol is employed to convince the user that the file is indeed being stored correctly. The security of these schemes is phrased in terms of an extractor which will recover the file given any ``proving algorithm'' that has a sufficiently high success probability. This forms the basis of {\em proof-of-retrievability} (PoR) systems.
In this paper, we study multiple server PoR systems. Our contribution in multiple-server
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Proof-of-RetrievabilityUnconditional Security
- Contact author(s)
-
m paterson @ bbk ac uk
dstinson @ math uwaterloo ca
jalaj @ psu edu - History
- 2016-03-08: received
- Short URL
- https://ia.cr/2016/265
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/265, author = {Maura B. Paterson and Douglas R. Stinson and Jalaj Upadhyay}, title = {Multi-prover Proof-of-Retrievability}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/265}, year = {2016}, url = {https://eprint.iacr.org/2016/265} }