An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Abstract Blockchain technology has a tendency to make revolutionary changes for all walks of life with its public, distributed, decentration and unforgeable characteristics. However, with the rapid development of the quantum computer, many extant cryptographic algorithms applied in blockchain-enabled systems are vulnerable to the quantum attacks. In this paper, an anti-quantum blind signature scheme based on the lattice assumption has been proposed. As lattice cryptography is the main candidate algorithm in post-quantum cryptosystems and the blind signature scheme is widely used in e-cash and voting for creating untraceable payment system, which are more suitable for privacy preserving in blockchain-enabled systems. In the proposed scheme, the bimodal Gaussian distribution, Reject sampling and other technologies have been used to improve the security and efficiency. Then, the proposed blind signature can satisfy the properties of blindness and one-more unforgeability, and it also can prove to be safe in the random oracle model. Moreover, the efficiency analysis and comparison results show that the proposed scheme is more efficient than the similar literatures and has a more stabilized signature size than other cryptosystems.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Blockchain for internet of things: a survey
Dai, H.-N., Zheng, Z., & Zhang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2920987 · Cited by 1,246
Introduction to post-quantum cryptography
Bernstein, D. J. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_1 · Cited by 364
A New Lattice-Based Signature Scheme in Post-Quantum Blockchain Network
Li, C.-Y., Chen, X.-B., Chen, Y.-L., Hou, Y.-Y., & Li, J. (2019) · IEEE Access · doi:10.1109/access.2018.2886554 · Cited by 126
Self-citation
Cited by
A survey on the adoption of blockchain in IoT: challenges and solutions
Uddin, M. A., Stranieri, A., Gondal, I., & Balasubramanian, V. (2021) · Blockchain: Research and Applications · doi:10.1016/j.bcra.2021.100006 · Cited by 365
Efficient Privacy Preserving in IoMT With Blockchain and Lightweight Secret Sharing
Li, C., Dong, M., Xin, X., Li, J., Chen, X.-B., & Ota, K. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3296595 · Cited by 118
Self-citationChaudhary, D., Santhi, P., Durgarao, M. S. P., Padmavathi, A., Mehedi Hassan, M., & Fahad Alkhamees, B. (2024) · IEEE Access · doi:10.1109/access.2024.3434691 · Cited by 21
“This paper contains notations for schemes as [28] by [A], [29] by [B], [30] by Since all the nodes with number N are new to the network and able to create transactions at the same time, they all require keys, which causes the key generation time to increase.”
BackgroundMethod
Metadata
- Authors
- Li, C., Tian, Y., Chen, X., & Li, J.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2021-02
- Volume
- 546
- Pages
- 253-264
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W3049054937
- Cited by
- 92
- References
- 5
- FWCI
- 4.45
- 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: An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. https://app.cochat.ai/papers/10.1016/j.ins.2020.08.032
- The paper
- Li, C., Tian, Y., Chen, X., & Li, J. (2021). An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Information Sciences. https://doi.org/10.1016/j.ins.2020.08.032
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.