The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Dynamic provable data possession
Abstract
We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files.We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nelog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
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
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Pors: 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
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
Skip lists: a probabilistic alternative to balanced trees
Pugh, W. (1990) · Communications of the ACM · doi:10.1145/78973.78977 · Cited by 1,165
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
Plutus: Scalable Secure File Sharing on Untrusted Storage
Kallahalla, M., Riedel, E., Swaminathan, R., Wang, Q., & Fu, K. E. (2003) · Cited by 666
Certificate revocation and certificate update
Naor, M., & Nissim, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839932 · Cited by 493
Dynamic authenticated index structures for outsourced databases
Li, F., Hadjieleftheriou, M., Kollios, G., & Reyzin, L. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142488 · Cited by 415
Secure Untrusted Data Repository (SUNDR)
Li, J., Krohn, M., Mazieres, D., & Shasha, D. (2003) · doi:10.21236/ada445862 · Cited by 394
Ivy: a read/write peer-to-peer file system
Muthitacharoen, A., Morris, R., Gil, T. M., & Chen, B. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844132 · Cited by 351
Checking the correctness of memories
Blum, M., Evans, W., Gemmell, P., Kannan, S., & Naor, M. (1994) · Algorithmica · doi:10.1007/bf01185212 · Cited by 201
Tamassia, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39658-1_2 · Cited by 190
Self-citationRiemann's Hypothesis and tests for primality
Miller, G. L. (1975) · Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 · doi:10.1145/800116.803773 · Cited by 186
Implementation of an authenticated dictionary with skip lists and commutative hashing
Goodrich, M. T., Tamassia, R., & Schwerin, A. (2002) · Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01 · doi:10.1109/discex.2001.932160 · Cited by 178
Self-citationHow to build a trusted database system on untrusted storage
Maheshwari, U., Vingralek, R., & Shapiro, W. H. (2000) · doi:10.5555/1251229.1251239 · Cited by 170
Papamanthou, C., Tamassia, R., & Triandopoulos, N. (2008) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1455770.1455826 · Cited by 133
Self-citationIncremental Multiset Hash Functions and Their Application to Memory Integrity Checking
Clarke, D. E., Devadas, S., van Dijk, M., Gassend, B., & Suh, G. E. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40061-5_12 · Cited by 126
Persistent Authenticated Dictionaries and Their Applications
Anagnostopoulos, A., Goodrich, M. T., & Tamassia, R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45439-x_26 · Cited by 115
Self-citationSpace-Efficient Block Storage Integrity.
Oprea, A., & Reiter, M. K. (2005) · Network and Distributed System Security Symposium · Cited by 86
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Tamassia, R., & Triandopoulos, N. (2005) · Lecture notes in computer science · doi:10.1007/11523468_13 · Cited by 46
Self-citation
Cited by
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462174 · Cited by 1,602
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Ren, K., Lou, W., & Li, J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.183 · Cited by 1,511
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
Wang, C., Wang, Q., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462173 · Cited by 1,415
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
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
Metadata
- Authors
- Erway, C., Küpçü, A., Papamanthou, C., & Tamassia, R.
- Venue
- Proceedings of the 16th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2009-11-09
- Pages
- 213-222
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2027703952
- Cited by
- 897
- References
- 23
- FWCI
- 29.63
- 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
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.