The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
MR-PDP: Multiple-Replica Provable Data Possession
Abstract
Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evidence that multiple copies of the data are actually stored. Storage servers can collude to make it look like they are storing many copies of the data, whereas in reality they only store a single copy. We address this shortcoming through multiple-replica provable data possession (MR-PDP): A provably-secure scheme that allows a client that stores t replicas of a file in a storage system to verify through a challenge-response protocol that (1) each unique replica can be produced at the time of the challenge and that (2) the storage system uses t times the storage required to store a single replica. MR-PDP extends previous work on data possession proofs for a single copy of a file in a client/server storage system (Ateniese et al., 2007). Using MR-PDP to store t replicas is computationally much more efficient than using a single-replica PDP scheme to store t separate, unrelated files (e.g., by encrypting each file separately prior to storing it). Another advantage of MR-PDP is that it can generate further replicas on demand, at little expense, when some of the existing replicas fail.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Self-citationPors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
PORs: Proofs of Retrievability for Large FilesPreprint
Juels, A., & Kaliski, B. S. (2007) · Cited by 404
Secure Untrusted Data Repository (SUNDR)
Li, J., Krohn, M., Mazieres, D., & Shasha, D. (2003) · doi:10.21236/ada445862 · Cited by 394
Cited by
Privacy-Preserving Public Auditing for Secure Cloud Storage
Wang, C., Chow, S. S. M., Wang, Q., Ren, K., & Lou, W. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.245 · Cited by 1,374
Blockchain Based Data Integrity Service Framework for IoT Data
Liu, B., Yu, X. L., Chen, S., Xu, X., & Zhu, L. (2017) · 2017 IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2017.54 · Cited by 385
Decentralized big data auditing for smart city environments leveraging blockchain technology
Yu, H., Yang, Z., & Sinnott, R. O. (2019) · IEEE Access · doi:10.1109/access.2018.2888940 · Cited by 130
Metadata
- Authors
- Curtmola, R., Khan, O., Burns, R., & Ateniese, G.
- Venue
- 2008 The 28th International Conference on Distributed Computing Systems
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 411-420
- OpenAlex
- W2132027883
- Cited by
- 473
- References
- 19
- FWCI
- 8.39
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: MR-PDP: Multiple-Replica Provable Data Possession. https://app.cochat.ai/papers/10.1109/icdcs.2008.68
- The paper
- Curtmola, R., Khan, O., Burns, R., & Ateniese, G. (2008). MR-PDP: Multiple-Replica Provable Data Possession. 2008 The 28th International Conference on Distributed Computing Systems. https://doi.org/10.1109/icdcs.2008.68
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
