检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhiruo Zhang Feng Wang Yang Liu Yang Lu Xinlei Liu
机构地区:[1]Department of Computer Technology,Henan University of Technology,Zhengzhou,450001,China
出 处:《Computers, Materials & Continua》2023年第9期3113-3129,共17页计算机、材料和连续体(英文)
基 金:supported by the Key Laboratory of Network Password Technology in Henan Province,China(LNCT2022-A20);the Major Science and Technology Special Project of Henan Province,China(Nos.201300210100,201300210200);the Key Scientific Research Project of Higher Education Institutions in Henan Province,China(No.23ZX017);the Key Special Project for Science and Technology Collaborative Innovation in Zhengzhou City,Henan Province,China(No.21ZZXTCX07);and the Key Science and Technology Project of Henan Province,China(No.232102211082).
摘 要:The consensus protocol is one of the core technologies in blockchain,which plays a crucial role in ensuring the block generation rate,consistency,and safety of the blockchain system.Blockchain systems mainly adopt the Byzantine Fault Tolerance(BFT)protocol,which often suffers fromslow consensus speed and high communication consumption to prevent Byzantine nodes from disrupting the consensus.In this paper,this paper proposes a new dual-mode consensus protocol based on node identity authentication.It divides the consensus process into two subprotocols:Check_BFT and Fast_BFT.In Check_BFT,the replicas authenticate the primary’s identity by monitoring its behaviors.First,assume that the systemis in a pessimistic environment,Check_BFT protocol detects whether the current environment is safe and whether the primary is an honest node;Enter the fast consensus stage after confirming the environmental safety,and implement Fast_BFT protocol.It is assumed that there are 3f+1 nodes in total.If more than 2f+1 nodes identify that the primary is honest,it will enter the Fast_BFT process.In Fast_BFT,the primary is allowed to handle transactions alone,and the replicas can only receive the messages sent by the primary.The experimental results show that the CF-BFT protocol significantly reduces the communication overhead and improves the throughput and scalability of the consensus protocol.Compared with the SAZyzz protocol,the throughput is increased by 3 times in the best case and 60%in the worst case.
关 键 词:Blockchain consensus protocol DUAL-MODE Byzantine fault tolerance distributed system
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.12.150