A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage

DOI10.1515/jmc-2013-5002zbMath1283.94079arXiv1210.7756OpenAlexW2144731398MaRDI QIDQ2861348

Maura B. Paterson, Jalaj Upadhyay, Douglas R. Stinson

Publication date: 12 November 2013

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7756

zbMATH Keywords

error-correcting codecloud storageproof-of-retrievability

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20) Network protocols (68M12)

Related Items (3)

Efficient proofs of retrievability using expander codes ⋮ Multi-prover proof of retrievability ⋮ 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