融合可验证随机函数和门限签名的拜占庭容错共识算法  

Byzantine Fault Tolerant Consensus Algorithm Based on Verifiable Random Function and Threshold Signature

作　　者：任永旺 段红军 王振飞[1] 王飞[1] REN Yong-wang;DUAN Hong-jun;WANG Zhen-fei;WANG fei(School of Computer and Artificial Intelligence,Zhengzhou University,Zhengzhou 450001,China;School of Zhengzhou Art Kindergarten Normal,Zhengzhou 450000,China)

机构地区：[1]郑州大学计算机与人工智能学院,郑州450001 [2]郑州艺术幼儿师范学校,郑州450000

出　　处：《小型微型计算机系统》2022年第7期1484-1493,共10页Journal of Chinese Computer Systems

基　　金：河南省高等教育教学改革研究项目(2019SJGLX001)资助;郑州大学教育教学改革与实践项目(2020zzuJXLX036)资助.

摘　　要：共识算法作为区块链底层的关键技术,可以解决分布式系统中由于节点分散而导致的共识难以达成的问题.现在联盟链中普遍使用的实用拜占庭容错共识算法,在准备阶段和提交阶段需要所有备份节点间互相交换信息,出现网络故障或者遭遇分布式拒绝服务攻击的时候,会出现活性差、可扩展性不强、鲁棒性不足等问题.针对上述问题,本文以联盟链在高校学生信息存储和管理运用为背景,在实用拜占庭容错算法基础上,提出一种融合可验证随机函数和门限签名的拜占庭容错共识算法.算法利用可验证随机函数的随机特性和零知识证明的特性来构造匿名选主算法,达到隐藏主节点,模糊敌手攻击对象,增强抵抗网络自适应攻击的能力.同时通过基于代表法定人数投票意愿的门限签名机制,使备份节点只通过验证门限签名,就能确认共识达成,从而保证在高丢帧率的网络环境下,增加达成共识的概率,提升拜占庭容错共识算法的鲁棒性.实验分析表明,系统在f个节点宕机、网络数据发送成功率只有80%的情况下,达成共识的概率依然超过90%,在提高共识概率的同时,降低签名验证的次数,提升了可扩展性,有效保证了系统的活性.As the key technology at the bottom of blockchain,consensus algorithm can solve the problem that it is difficult to reach consensus due to node dispersion in distributed system.At present,the practical Byzantine fault-tolerant consensus algorithm widely used in the alliance chain needs all backup nodes to exchange information with each other in the preparation stage and submission stage.In case of network failure or distributed denial of service attack,there will be problems such as poor activity,weak scalability and insufficient robustness.Aiming at the above problems,based on the application of alliance chain in the information storage and management of college students,and based on the practical Byzantine fault-tolerant algorithm,this paper proposes a Byzantine fault-tolerant consensus algorithm integrating verifiable random function and threshold signature.The algorithm uses the random characteristics of verifiable random function and the characteristics of zero knowledge proof to construct an anonymous master selection algorithm,so as to hide the master node,blur the enemy attack object,and enhance the ability to resist network adaptive attacks.At the same time,through the threshold signature mechanism based on the voting intention of the quorum,the backup node can confirm the consensus only by verifying the threshold signature,so as to increase the probability of consensus and improve the robustness of Byzantine fault-tolerant consensus algorithm in the network environment with high frame loss rate.The experimental analysis shows that when f nodes are down and the success rate of network data transmission is only 80%,the probability of reaching a consensus is still more than 90%.While improving the consensus probability,the number of signature verification is reduced,the scalability is improved,and the activity of the system is effectively guaranteed.

关 键 词：区块链 联盟链 拜占庭容错 共识算法 可验证随机函数 门限签名 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]