{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:26Z","timestamp":1764996986423,"version":"3.46.0"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,1]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n                  <jats:p>\n                    There has been considerable recent interest in \u201ccloud storage\u201d wherein\na user asks a server to store a large file. One issue is whether the user can\nverify that the server is actually storing the file, and typically a challenge-response\nprotocol is employed to convince the user that the file is indeed being stored\ncorrectly. The security of these schemes is phrased in terms of an extractor which will\nrecover or retrieve the file given any \u201cproving algorithm\u201d that has a\nsufficiently high success probability.\nThis paper treats proof-of-retrievability schemes in the model of unconditional\nsecurity, where an adversary has unlimited computational power. In this case retrievability\nof the file can be modelled as error-correction in a certain code. We provide a\ngeneral analytical framework for such schemes that yields exact (non-asymptotic) reductions\nthat precisely quantify conditions for extraction to succeed as a function of the success\nprobability of a proving algorithm, and we apply this analysis to several\narchetypal schemes. In addition, we provide a new methodology for the analysis\nof keyed\n                    <jats:sans-serif>POR<\/jats:sans-serif>\n                    schemes in an unconditionally secure setting, and use it to\nprove the security of a modified version of a scheme due to Shacham and Waters\n[Lecture Notes in Comput. Sci. 5350, Springer (2008), 90\u2013107]\nunder a slightly restricted attack model, thus providing the first example of a keyed\n                    <jats:sans-serif>POR<\/jats:sans-serif>\n                    scheme\nwith unconditional security. We also show how classical statistical techniques can be used to evaluate whether the responses of the prover are\naccurate enough to permit successful extraction. Finally, we prove a new lower bound on storage and communication complexity of\n                    <jats:sans-serif>POR<\/jats:sans-serif>\n                    schemes.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2013-5002","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T18:24:36Z","timestamp":1380133476000},"page":"183-216","source":"Crossref","is-referenced-by-count":6,"title":["A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage"],"prefix":"10.1515","volume":"7","author":[{"given":"Maura\u00a0B.","family":"Paterson","sequence":"first","affiliation":[{"name":"Department of Economics, Mathematics and Statistics, Birkbeck, University of London, Malet Street, London WC1E 7HX, UK"}]},{"given":"Douglas\u00a0R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada"}]},{"given":"Jalaj","family":"Upadhyay","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada"}]}],"member":"374","published-online":{"date-parts":[[2013,9,25]]},"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2013-5002\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2013-5002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:17:06Z","timestamp":1764980226000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2013-5002\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,9,25]]},"published-print":{"date-parts":[[2013,10,1]]}},"alternative-id":["10.1515\/jmc-2013-5002"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2013-5002","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"type":"electronic","value":"1862-2984"},{"type":"print","value":"1862-2976"}],"subject":[],"published":{"date-parts":[[2013,9,25]]}}}