The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
New Publicly Verifiable Databases with Efficient Updates
Abstract
The notion of verifiable database (VDB) enables a resource-constrained client to securely outsource a very large database to an untrusted server so that it could later retrieve a database record and update it by assigning a new value. Also, any attempt by the server to tamper with the data will be detected by the client. Very recently, Catalano and Fiore [17] proposed an elegant framework to build efficient VDB that supports public verifiability from a new primitive named vector commitment. In this paper, we point out Catalano-Fiore's VDB framework from vector commitment is vulnerable to the so-called forward automatic update (FAU) attack. Besides, we propose a new VDB framework from vector commitment based on the idea of commitment binding. The construction is not only public verifiable but also secure under the FAU attack. Furthermore, we prove that our construction can achieve the desired security properties.
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
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712
Cited by
Identity-Based Remote Data Integrity Checking With Perfect Data Privacy Preserving for Cloud Storage
Yu, Y., Au, M. H., Ateniese, G., Huang, X., Susilo, W., Dai, Y., & Min, G. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2615853 · Cited by 479
Self-citationBlockchain Meets Cloud Computing: A Survey
Gai, K., Guo, J., Zhu, L., & Yu, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2989392 · Cited by 381
Wang, W., Zhao, M., & Wang, J. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-018-0803-6 · Cited by 284
Anonymous and Traceable Group Data Sharing in Cloud Computing
Shen, J., Zhou, T., Chen, X., Li, J., & Susilo, W. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2774439 · Cited by 253
Self-citationBlockchain based Efficient and Robust Fair Payment for Outsourcing Services in Cloud Computing
Zhang, Y., Deng, R. H., Liu, X., & Zheng, D. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.018 · Cited by 228
Metadata
- Authors
- Chen, X., Li, J., Huang, X., Ma, J., & Lou, W.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2015-09-01
- Volume
- 12
- Issue
- 5
- Pages
- 546-556
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W1984462474
- Cited by
- 242
- References
- 1
- FWCI
- 13.86
- Type
- journal article
- 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: New Publicly Verifiable Databases with Efficient Updates. https://app.cochat.ai/papers/10.1109/tdsc.2014.2366471
- The paper
- Chen, X., Li, J., Huang, X., Ma, J., & Lou, W. (2015). New Publicly Verifiable Databases with Efficient Updates. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2014.2366471
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.