articleOct 28, 2007Closed access

Provable data possession at untrusted stores

Johns Hopkins University · Google (United States) · +1 more institution

Indexed incrossref

Abstract

We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage system.

Citation impact

2,685
total citations
FWCI
38.73
Percentile
100%
References
52
Citations per year

Authors

7

Topics & keywords

Keywords
  • Computer science
  • Metadata
  • Possession (linguistics)
  • Mathematical proof
  • Server
  • Constant (computer programming)
  • Computer network
  • Probabilistic logic
No related works found for this paper.

Funding