A New Lattice-Based Signature Scheme in Post-Quantum Blockchain Network
Open accessAbstract
Blockchain technology has gained significant prominence in recent years due to its public, distributed, and decentration characteristics, which was widely applied in all walks of life requiring distributed trustless consensus. However, the most cryptographic protocols used in the current blockchain networks are susceptible to the quantum attack with rapid development of a sufficiently large quantum computer. In this paper, we first give an overview of the vulnerabilities of the modern blockchain networks to a quantum adversary and some potential post-quantum mitigation methods. Then, a new lattice-based signature scheme has been proposed, which can be used to secure the blockchain network over existing classical channels. Meanwhile, the public and private keys are generated by the Bonsai Trees technology withRandBasisalgorithm from the root keys, which not only ensure the randomness, but also construct the lightweight nondeterministic wallets. Then, the proposed scheme can be proved secure in random oracle model, and it is also more efficient than similar literatures. In addition, we also give the detailed description of the post-quantum blockchain transaction. Furthermore, this work can help to enrich the research on the future post-quantum blockchain (PQB).
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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Li et al. implemented a lattice-based solution where public and private keys are generated with Bonsai Trees technology, and used algorithms that ensure randomness and construct lightweight nondeterministic wallets.
“Li et al. implemented a lattice-based solution where public and private keys are generated with Bonsai Trees technology, and used algorithms that ensure randomness and construct lightweight nondeterministic wallets93.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [93]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 32 · Cited by 126
Research works printed but not linked: 1
- M. A. Nielsen and I. Chuang, ''Quantum computation and quantum infor- mation,'' pp. 558-559, 2002.
- Authors
- Li, C.-Y., Chen, X.-B., Chen, Y.-L., Hou, Y.-Y., & Li, J.
- Affiliations
- Guizhou University (CN)
- Zaozhuang University (CN)
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 2026-2033
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2903928648
- Cited by
- 126
- References
- 32
- Citations by year
- 2026: 9 · 2025: 24 · 2024: 20 · 2023: 18 · 2022: 21 · 2021: 16 · 2020: 11 · 2019: 7
- FWCI
- 4.76
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Natural Science Foundation of China (U1636106, 61671087, 61170272)
- Natural Science Foundation of Beijing Municipality (4182006)
- Major Science and Technology Support Program of Guizhou Province (20183001)
- Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data (2018BDKFJJ016, 2018BDKFJJ018)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Keywords
- lattice-based cryptography, digital signatures, bonsai, key generation, random oracle model security, blockchain transactions, post-quantum cryptography
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