基于多父链辅助工作量证明共识机制的后量子区块链系统
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

王御天,E-mail:23110240140@m.fudan.edu.cn

中图分类号:

基金项目:

国家重点研发计划(2022YFB2701601); 上海市协同创新基金(XTCX-KJ-2023-54); 上海市科委区块链关键技术攻关专项基金(23511100300)


Post-quantum Blockchain System Based on Multi-parent Chain Auxiliary Proof-of-work Consensus Mechanism
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    随着量子计算机的发展, 对于以传统椭圆曲线数字签名为基石的公链会造成颠覆性安全问题, 常见解决方案是将后量子数字签名算法应用到区块链系统中. 对于采用工作量证明共识机制的区块链公链, 支持算力也是公链安全的重要基石, 如何节省能源且最大化算力支持是一个重要研究方向. 因此, 提出一种算力多元化且应用自主可控后量子签名的后量子区块链系统. Dilithium签名方案是美国国家标准研究院(National Institute of Standards and Technology, NIST)所推荐的首选和通用后量子签名标准, 其安全性基于power-of-two分圆环上的MLWE和MSIS问题. 但是, 正如比特币区块链虽然最初采用EC-DSA标准签名算法, 却并没有采用美国NIST所规定的椭圆曲线一样, power-of-two分圆环丰富的代数结构为公链所基于的后量子数字签名的长远安全带来较大风险和不确定性. 素阶数域是一种代数结构更少、更为保守和安全的后量子格基密码技术路线. 采用基于素阶数域的后量子数字签名Dilithium变体: Dilithium-Prime, 作为后量子区块链系统的签名算法以提供高置信度的交易签署后量子安全. 为了提供多元化的算力以最大化后量子公链的算力支持, 并解决目前矿池和矿工收入不断减少的困境, 引入一种基于多父链辅助工作量证明共识机制, 可以请求所有采用Sha256和Scrypt哈希计算的算力来辅助共识而不额外增加现有矿工和矿池的工作量, 在增加了后量子区块链的算力来源的同时也提高了现有矿池和矿工的算力利用率. 同时, 提出适配这种多父链辅助工作量共识机制的区块和交易结构和难度调整算法, 针对不同量级的算力, 稳定出块比例和出块时间, 并可有效应对算力突增、突减等极端情况攻击以保持系统的健壮性.

    Abstract:

    With the development of quantum computers, public blockchains relying on traditional elliptic curve digital signatures are expected to face disruptive security risks. A common solution involves the application of post-quantum digital signature algorithms within blockchain systems. For public blockchains utilizing the proof-of-work consensus mechanism, ensuring sufficient computing power is regarded as a critical foundation for security. Energy conservation and the maximization of computing power support have been identified as key research directions. Therefore, a post-quantum blockchain system featuring diversified computing power and autonomous post-quantum signature is proposed in this study. The Dilithium signature scheme, recommended by the National Institute of Standards and Technology (NIST) as a preferred and general-purpose post-quantum signature standard, relies on the security of MLWE and MSIS problems in power-of-two cyclotomic rings. However, similar to the early adoption of the EC-DSA standard in Bitcoin without adherence to the NIST-specific elliptic curves, the rich algebraic structure of power-of-two cyclotomic rings poses greater risks and uncertainties regarding long-term security. To address this, a more conservative and secure approach, based on post-quantum lattice-based cryptography with fewer algebraic structures, is constructed. In this study, a Dilithium variant, Dilithium-Prime, based on a large-Galois-group prime-degree prime-ideal field, is proposed as the signature algorithm for the post-quantum blockchain system to ensure high-confidence transaction signing with post-quantum security. To maximize the computing power support for the post-quantum public blockchain and address the current issue of declining mining pool and miner income, a multi-parent chain auxiliary proof-of-work consensus mechanism is introduced. This mechanism enables the request of computing power from all miners using Sha256 and Scrypt hash calculations to assist in consensus without increasing the workload for existing miners and mining pools. As a result, the source of computing power for the post-quantum blockchain is expanded, and the utilization rate of existing mining pools and miners is improved. In addition, a block and transaction structure, along with a difficulty adjustment algorithm tailored for this multi-parent chain auxiliary proof-of-work consensus mechanism, is proposed. This system stabilizes the block production ratio and production time across different levels of computing power and effectively responds to extreme cases, such as sudden surges or reductions in computing power, ensuring the system’s robustness.

    参考文献
    相似文献
    引证文献
引用本文

王御天,贾舒瑞,陈铭希,董怡帆,杨亚芳.基于多父链辅助工作量证明共识机制的后量子区块链系统.软件学报,2025,36(10):4507-4524

复制
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2024-06-30
  • 最后修改日期:2024-09-05
  • 录用日期:
  • 在线发布日期: 2025-01-20
  • 出版日期: 2025-10-06
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号