The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
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
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
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418 · cited 1×
“A Merkle Hash Tree (MHT) is a well-studied authentication structure [17], which is intended to efficiently and securely prove that a set of elements are undamaged and unaltered.”
BackgroundCompact 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
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
Dynamic provable data possession
Erway, C., Küpçü, A., Papamanthou, C., & Tamassia, R. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653688 · Cited by 897
Ensuring data storage security in Cloud Computing
Wang, C., Wang, Q., Ren, K., & Lou, W. (2009) · 2009 17th International Workshop on Quality of Service · doi:10.1109/iwqos.2009.5201385 · Cited by 767
Self-citationBowers, K. D., Juels, A., & Oprea, A. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653686 · Cited by 749
Proofs of retrievability: theory and implementation
Bowers, K. D., Juels, A., & Oprea, A. (2009) · Proceedings of the 2009 ACM workshop on Cloud computing security · doi:10.1145/1655008.1655015 · Cited by 447
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
Wang, Q., Ren, K., Lou, W., & Zhang, Y. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062006 · Cited by 113
Self-citationRemote Integrity Check with Dishonest Storage Server
Chang, E., & Xu, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88313-5_15 · Cited by 98
Space-Efficient Block Storage Integrity.
Oprea, A., & Reiter, M. K. (2005) · Network and Distributed System Security Symposium · Cited by 86
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
Self-citationEnabling 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
Self-citationPrivacy-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
Self-citationPrivacy-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
Self-citationKamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
Metadata
- Authors
- Wang, Q., Wang, C., Li, J., Ren, K., & Lou, W.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 355-370
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1659280461
- Cited by
- 892
- References
- 14
- FWCI
- 33.37
- 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.