The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases
Abstract
Blockchains have recently been under the spotlight due to the boom of cryptocurrencies and decentralized applications. There is an increasing demand for querying the data stored in a blockchain database. To ensure query integrity, the user can maintain the entire blockchain database and query the data locally. However, this approach is not economic, if not infeasible, because of the blockchain's huge data size and considerable maintenance costs. In this paper, we take the first step toward investigating the problem of verifiable query processing over blockchain databases. We propose a novel framework, called vChain, that alleviates the storage and computing costs of the user and employs verifiable queries to guarantee the results' integrity. To support verifiable Boolean range queries, we propose an accumulator-based authenticated data structure that enables dynamic aggregation over arbitrary query attributes. Two new indexes are further developed to aggregate intra-block and inter-block data records for efficient query verification. We also propose an inverted prefix tree structure to accelerate the processing of a large number of subscription queries simultaneously. Security analysis and empirical study validate the robustness and practicality of the proposed techniques.
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
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Cited by
Towards Public Verifiable and Forward-Privacy Encrypted Search by Using Blockchain
Guo, Y., Zhang, C., Wang, C., & Jia, X. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3173291 · Cited by 263
Self-citationVFIRM: Verifiable Fine-Grained Encrypted Image Retrieval in Multi-owner Multi-user Settings
Tong, Q., Miao, Y., Chen, L., Weng, J., Liu, X., Choo, K.-K. R., & Deng, R. H. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2021.3083512 · Cited by 58
SE-Chain: A Scalable Storage and Efficient Retrieval Model for Blockchain
Jia, D.-Y., Xin, J.-C., Wang, Z.-Q., Lei, H., & Wang, G.-R. (2021) · Journal of Computer Science and Technology · doi:10.1007/s11390-020-0158-2 · Cited by 38
VeriRange: A Verifiable Range Query Model on Encrypted Geographic Data for IoT Environment
Ma, W., Peng, Y., Liu, X., & Cui, J. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3294589 · Cited by 5
Metadata
- Authors
- Xu, C., Zhang, C., & Xu, J.
- Venue
- Proceedings of the 2019 International Conference on Management of Data
- Publisher
- ACM
- Published
- 2019-06-25
- Pages
- 141-158
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2903368601
- Cited by
- 222
- References
- 1
- FWCI
- 20.10
- 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: vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases. https://app.cochat.ai/papers/10.1145/3299869.3300083
- The paper
- Xu, C., Zhang, C., & Xu, J. (2019). vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases. Proceedings of the 2019 International Conference on Management of Data. https://doi.org/10.1145/3299869.3300083
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.