Is extracting data the same as possessing data?

Proof-of-retrievability schemes have been a topic of considerable recent interest. In these schemes, a client gives a file to a server with the understanding that will securely store . A suitable challenge-response protocol is invoked by in order for to gain confidence that is indeed being correctly...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical cryptology 2014-06, Vol.8 (2), p.189-207
Main Authors: Stinson, Douglas R., Upadhyay, Jalaj
Format: Article
Language:English
Subjects:
94A60
proof-of-data-observability
Proof-of-retrievability
Protocol
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Proof-of-retrievability schemes have been a topic of considerable recent interest. In these schemes, a client gives a file to a server with the understanding that will securely store . A suitable challenge-response protocol is invoked by in order for to gain confidence that is indeed being correctly stored by . The definition of proof-of-retrievability schemes is based on the notion of an extractor that can recover the file once the challenge-response protocol is executed a sufficient number of times. In this paper, we propose a new type of scheme that we term a . Our definition tries to capture the stronger requirement that must have an actual copy of in its memory space while it executes the challenge-response protocol. We give some examples of schemes that satisfy this new security definition. As well, we analyze the efficiency and security of the protocols we present, and we prove some necessary conditions for the existence of these kinds of protocols.
ISSN:1862-2976
1862-2984
DOI:10.1515/jmc-2013-0034