## Abstract

Proof-of-retrievability schemes have been a topic of considerable recent interest. In these schemes, a client {C} gives a file M to a server {S} with the understanding that {S} will securely store M. A suitable challenge-response protocol is invoked by {C} in order for {C} to gain confidence that M is indeed being correctly stored by {S}. The definition of proof-of-retrievability schemes is based on the notion of an extractor {E} 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 proof-of-data- observability scheme. Our definition tries to capture the stronger requirement that {S} must have an actual copy of M 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.

Original language | English (US) |
---|---|

Pages (from-to) | 189-207 |

Number of pages | 19 |

Journal | Journal of Mathematical Cryptology |

Volume | 8 |

Issue number | 2 |

DOIs | |

State | Published - Jun 1 2014 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Computational Mathematics
- Applied Mathematics

## Keywords

- proof-of-data-observability
- Proof-of-retrievability