检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈珩 黄世成 郑明辉 CHEN Heng;HUANG Shicheng;ZHENG Minghui(College of Intelligent Systems Science and Engineering,Hubei Minzu University,Enshi 445000,China)
机构地区:[1]湖北民族大学智能科学与工程学院,湖北恩施445000
出 处:《湖北民族大学学报(自然科学版)》2024年第2期185-190,共6页Journal of Hubei Minzu University:Natural Science Edition
基 金:国家自然科学基金项目(61772181);湖北民族大学研究生科研创新资助项目(MYK2024085)。
摘 要:针对区块链中拜占庭类共识算法主节点权限过高导致中心化集权与共识效率低下的问题,提出了一种双主节点的实用拜占庭容错(dual-master node practical Byzantine fault tolerance,DMNPBFT)共识算法。首先确定了区块链节点之间双主节点的权力,通过双主节点的交互模式减少中心化带来的权力集中影响。在信息交易传播过程中将双主节点与秘密分享技术相结合,确保联盟链中所有节点对交易信息达成一致,解决了节点之间为确认共识而造成的由复杂信息传播引起的共识效率较低的问题。双主节点利用秘密分享中的聚合算法生成主密钥并将主密钥与原密钥进行一致性比较,从而完成共识交易。DMNPBFT算法在计算上具备安全性与健壮性,共识轮数量仅有3轮。实验表明,相较于传统PBFT算法,DMNPBFT算法的共识一致性与容错处理能力均显著增强,共识时延减少了97.7%。该算法提高了联盟链节点处理数据的能力,能够在大数据流量下完成联盟链中数据的安全性共识传输操作。A dual-master node practical Byzantine fault tolerance(DMNPBFT)consensus algorithm with was proposed to solve the problem of centralized authority and low consensus efficiency caused by excessive authority of the master node of Byzantine consensus algorithm in blockchain.The algorithm first determined the power of the dual-master node among the blockchain nodes,and reduced the influence of power concentration caused by centralization through the interaction mode of the dual-master node.In the process of information transaction transmission,the combination of dual-master node and secret sharing technology was used to determine that all nodes in the alliance chain reach a consensus on transaction information,which solved the problem of low consensus efficiency caused by complex information transmission to confirm consensus among the nodes.The dual-master node used the aggregation algorithm in secret sharing to generate the master key,and compared the consistency between the master key and the original key to complete the consensus transaction.The algorithm was safe and robust in computation,and the number of consensus rounds is only 3.The experiments showed the consensus consistency and fault-tolerant processing ability of the scheme were significantly enhanced compared to the traditional PBFT algorithm,and the consensus latency was decreased by 97.7%.The proposed algorithm effectively improves the ability of data processing in alliance chain nodes,and can complete the security consensus transmission operation of data in alliance chain under big data traffic.
关 键 词:区块链 共识算法 加解密算法 联盟链 秘密分享 子密钥 签名算法
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171