Lightweight quantum-resistant distributed consensus scheme for blockchain

Zhang Dejun; Li Jian; Wang Naile; Zhang Chunhui

doi:10.11959/j.issn.2096-109x.AQ25268

您当前的位置：

首页 >

文章列表页 >

Lightweight quantum-resistant distributed consensus scheme for blockchain

Papers | 更新时间：2026-07-15

- Lightweight quantum-resistant distributed consensus scheme for blockchain
- Chinese Journal of Network and Information Security Vol. 12, Issue 3, Pages: 93-109(2026)
- 作者机构：
  
  北京邮电大学网络空间安全学院，北京 100876
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(U1636106)
- DOI：10.11959/j.issn.2096-109x.AQ25268
  CLC： TP393
- Received：27 December 2025，
  
  Revised：2026-05-19，
  
  Accepted：26 May 2026，
  
  Published：25 June 2026
- 稿件说明：
移动端阅览
张德俊, 李剑, 王乃乐, 等. 面向区块链的轻量级抗量子分布式共识方案[J]. 网络与信息安全学报, 2026, 12(3): 93-109.

Zhang Dejun, Li Jian, Wang Naile, et al. Lightweight quantum-resistant distributed consensus scheme for blockchain[J]. Chinese Journal of Network and Information Security, 2026, 12(3): 93-109.
张德俊, 李剑, 王乃乐, 等. 面向区块链的轻量级抗量子分布式共识方案[J]. 网络与信息安全学报, 2026, 12(3): 93-109. DOI： 10.11959/j.issn.2096-109x.AQ25268.

Zhang Dejun, Li Jian, Wang Naile, et al. Lightweight quantum-resistant distributed consensus scheme for blockchain[J]. Chinese Journal of Network and Information Security, 2026, 12(3): 93-109. DOI： 10.11959/j.issn.2096-109x.AQ25268.

摘要

现有抗量子算法存在计算复杂度高、存储开销大的问题，且当前区块链系统在多节点环境下共识吞吐量压力显著。针对上述问题，提出了面向区块链的轻量级抗量子分布式共识方案，通过改进基于哈希的安全后量子互联网通信签名增强版（secure post-quantum hash-based internet communication signatures plus

SPHINCS+）抗量子签名算法中的随机子集森林（forest of random subsets

FORS）结构，减少签名体积和存储负担，设计改进Winternitz一次签名（Winternitz one-time signature

WOTS+）结构，降低算法计算复杂度。提出了分组实用拜占庭容错（practical byzantine fault tolerance

PBFT）共识机制，并结合积分与加权随机森林模型设计主节点选举机制，降低通信开销、提升网络可靠性与吞吐量。实验结果显示，与传统SPHINCS+抗量子签名算法及改进PBFT的方案相比，该方案签名平均验证速率和共识吞吐量分别提升25%和28%，签名存储压力和共识时延分别降低31%和25%，表明该方案能够提升区块链系统的签名、验证效率和系统吞吐量，并降低共识时延。

Abstract

Existing post-quantum cryptographic algorithms have been confronted with high computational complexity and large storage overhead

while current blockchain systems have suffered from significant consensus throughput pressure in multi-node environments. To address these issues

a lightweight post-quantum distributed consensus scheme for blockchain systems was proposed in this work. The scheme was constructed by improving the FORS structure in the SPHINCS+ post-quantum signature algorithm

through which the signature size and storage burden were reduced

and by designing an improved WOTS+ structure to decrease the computational complexity of the algorithm. Furthermore

a grouped PBFT consensus mechanism was proposed

and a primary node election mechanism was designed by integrating a credit-based scoring strategy with a weighted random forest model

thereby reducing communication overhead and improving network reliability and throughput. Experimental results demonstrated that

compared with the traditional SPHINCS+ post-quantum scheme and improved PBFT algorithms

the proposed scheme achieved improvements of 25% and 28% in average signature verification rate and consensus throughput

respectively

while the signature storage pressure and consensus latency were reduced by approximately 31% and 25%. These results indicate that the proposed scheme effectively enhances signature and verification efficiency as well as overall system throughput of blockchain systems

while reducing consensus latency.

关键词

Keywords

references

Gharavi H , Granjal J , Monteiro E . Post-quantum blockchain security for the internet of things: survey and research directions [J ] . IEEE Communications Surveys Tutorials , 2024 , 26 ( 3 ): 1748 - 1774 .

Hossain Faruk M J , Tahora S , Tasnim M , et al . A review of quantum cybersecurity: threats, risks and opportunities [C ] // Proceedings of the 2022 1st International Conference on AI in Cybersecurity (ICAIC) . Piscataway : IEEE Press , 2022 : 1 - 8 .

张振琦 , 朱秋池 , 王志伟 . 带鲁棒性的子分组多重Schnorr签名方案 [J ] . 网络与信息安全学报 , 2024 , 10 ( 4 ): 132 - 142 .

Zhang Z Q , Zhu Q C , Wang Z W . Robust schnorr-based subgroup multi-signature scheme [J ] . Chinese Journal of Network and Information Security , 2024 , 10 ( 4 ): 132 - 142 .

李继国 , 方淳 . 基于SM9的指定验证者聚合签名方案 [J ] . 网络与信息安全学报 , 2024 , 10 ( 4 ): 63 - 71 .

Li J G , Fang C . Designated verifier aggregate signature scheme based on SM9 [J ] . Chinese Journal of Network and Information Security , 2024 , 10 ( 4 ): 63 - 71 .

Diffie W , Hellman M . New directions in cryptography [J ] . IEEE Transactions on Information Theory , 1976 , 22 ( 6 ): 644 - 654 .

Lamport L . Constructing digital signatures from a one way function [R ] . 1979 .

Merkle R C . Secrecy, authentication, and public key systems [D ] . Stanford : Stanford University , 1979 .

Merkle R C . A certified digital signature [C ] // Advances in Cryptology-CRYPTO’ 89 Proceedings . New York, NY : Springer , 1990 : 218 - 238 .

Reyzin L , Reyzin N . Better than BiBa: short one-time signatures with fast signing and verifying [C ] // Information Security and Privacy . Berlin, Heidelberg : Springer , 2002 : 144 - 153 .

Bernstein D J , Hopwood D , Hülsing A , et al . SPHINCS: practical stateless hash-based signatures [C ] // Advances in Cryptology -- EUROCRYPT 2015 . Berlin, Heidelberg : Springer , 2015 : 368 - 397 .

Bernstein D J , Hülsing A , Kölbl S , et al . The SPHINCS+ signature framework [C ] // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2019 : 2129 - 2146 .

Wang X A , Liu H , Jiang W W , et al . A SM3 hash-based post-quantum signature scheme and its application to food source authentication [J ] . IEEE Internet of Things Journal , 2025 , 12 ( 23 ): 49233 - 49247 .

Shahid F , Khan A , Malik S U R , et al . WOTS-S: a quantum secure compact signature scheme for distributed ledger [J ] . Information Sciences , 2020 , 539 : 229 - 249 .

Zhang K Y , Cui H R , Yu Y . SPHINCS-α: A compact stateless hash-based signature scheme [Z ] . 2022 .

Crain T , Gramoli V , Larrea M , et al . DBFT: efficient leaderless Byzantine consensus and its application to blockchains [C ] // Proceedings of the 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) . Piscataway : IEEE Press , 2018 : 1 - 8 .

Sun Y Y , Yan B W , Yao Y , et al . DT-DPoS: a delegated proof of stake consensus algorithm with dynamic trust [J ] . Procedia Computer Science , 2021 , 187 : 371 - 376 .

Fu J H , Zhou W H , Xu M X , et al . New public blockchain protocol based on sharding and aggregate signatures [J ] . Journal of High Speed Networks , 2021 , 27 ( 1 ): 83 - 99 .

袁昊天 , 李飞 . 基于改进Raft共识算法和PBFT共识算法的双层共识算法 [J ] . 计算机应用研究 , 2024 , 41 ( 5 ): 1314 - 1320 .

Yuan H T , Li F . Double layer consensus algorithm based on improved raft consensus algorithm and PBFT [J ] . Application Research of Computers , 2024 , 41 ( 5 ): 1314 - 1320 .

Zhu J , Lu C F , Li J J , et al . Secure consensus control on multi-agent systems based on improved PBFT and raft blockchain consensus algorithms [J ] . IEEE/CAA Journal of Automatica Sinica , 2025 , 12 ( 7 ): 1407 - 1417 .

Zhong W , Feng W L , Huang M X , et al . ST-PBFT: an optimized PBFT consensus algorithm for intellectual property transaction scenarios [J ] . Electronics , 2023 , 12 ( 2 ): 325 .

Ji Y L , Zou Y , Wang G , et al . An improved PBFT consensus algorithm based on reputation grading and voting in IoT environment [C ] // Proceedings of the 2024 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) . Piscataway : IEEE Press , 2025 : 2121 - 2128 .

Mu Z Q , Liu Y Y , Yang Y L . A large-scale group decision making model with a clustering algorithm based on a locality sensitive hash function [J ] . Engineering Applications of Artificial Intelligence , 2025 , 140 : 109697 .

Ding J W , Wu X , Tian J , et al . RE-BPFT: an improved PBFT consensus algorithm for consortium blockchain based on node credibility and ID3-based classification [J ] . Applied Sciences , 2025 , 15 ( 13 ): 7591 .

Chang Y X , Wang Q , Li Q L , et al . Performance and reliability analysis for PBFT-based blockchain systems with repairable voting nodes [J ] . IEEE Transactions on Network and Service Management , 2024 , 21 ( 4 ): 4039 - 4060 .

Yao Z Y , Fang Y H , Pan H , et al . A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading [J ] . Scientific Reports , 2024 , 14 : 8300 .

Liu X , Fan X , Niu B N , et al . 5G-practical Byzantine fault tolerance: an improved PBFT consensus algorithm for the 5G network [J ] . Information , 2025 , 16 ( 3 ): 202 .

Xiao J , Luo T , Li C Q , et al . CE-PBFT: a high availability consensus algorithm for large-scale consortium blockchain [J ] . Journal of King Saud University - Computer and Information Sciences , 2024 , 36 ( 2 ): 101957 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Ring adaptor signature scheme based on SM2 digital signature algorithm

Survey of decentralized public key infrastructure

Chameleon hash function based on SM3 and its applications

Blockchain smart contract vulnerability detection based on GR algorithm

Design of reputation-driven blockchain sharding consensus and incentive mechanism

Related Author

Xu Xinyue

Xu Shujiang

Wang Lianhai

Zhang Shuhui

Shao Wei

Wang Qizheng

SHI Chaoming

YAN Zheng

Related Institution

Shandong Provincial Key Laboratory of Industrial Network and Information System Security, Shandong Fundamental Research Center for Computer Science

Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences)

Shield Lab, Trustworthiness Lab, Huawei Technologies Co., Ltd.

State Key Laboratory of Integrated Services Network, Xidian University, Xi’ an

School of Cyber Engineering, Xidian University, Xi’ an

⁰