A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
From MaRDI portal
Publication:2861348
DOI10.1515/JMC-2013-5002zbMATH Open1283.94079arXiv1210.7756OpenAlexW2144731398MaRDI QIDQ2861348FDOQ2861348
Authors: Maura Paterson, Jalaj Upadhyay, D. R. Stinson 
Publication date: 12 November 2013
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
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 or retrieve the file given any "proving algorithm" that has a sufficiently high success probability. This paper treats proof-of-retrievability schemes in the model of unconditional security, where an adversary has unlimited computational power. In this case retrievability of the file can be modelled as error-correction in a certain code. We provide a general analytical framework for such schemes that yields exact (non-asymptotic) reductions that precisely quantify conditions for extraction to succeed as a function of the success probability of a proving algorithm, and we apply this analysis to several archetypal schemes. In addition, we provide a new methodology for the analysis of keyed POR schemes in an unconditionally secure setting, and use it to prove the security of a modified version of a scheme due to Shacham and Waters under a slightly restricted attack model, thus providing the first example of a keyed POR scheme with unconditional security. We also show how classical statistical techniques can be used to evaluate whether the responses of the prover are accurate enough to permit successful extraction. Finally, we prove a new lower bound on storage and communication complexity of POR schemes.
Full work available at URL: https://arxiv.org/abs/1210.7756
Recommendations
- Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
- Proofs of storage: theory, constructions and applications
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud, revisited
- Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited
- A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud
- On the existence of provably secure cloud computing systems
Cited In (8)
- Proofs of retrievability via fountain code
- A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
- Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited
- Multi-prover proof of retrievability
- Is extracting data the same as possessing data?
- Proofs of Retrievability via Hardness Amplification
- Efficient proofs of retrievability using expander codes
- Generic constructions of PoRs from codes and instantiations
This page was built for publication: A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861348)
