计算机科学
Byzantine容错
节点(物理)
块链
戒指签名
计算机网络
容错
分布式计算
块(置换群论)
戒指(化学)
计算机安全
公钥密码术
加密
数学
工程类
化学
几何学
结构工程
有机化学
作者
Liquan Chen,Chengjing Wang,Wenxuan Jiang
标识
DOI:10.1109/icccs57501.2023.10151277
摘要
To address the problems of existing consensus mechanism in blockchain such as too much information interactions among nodes, and simple election strategy of master node, this paper firstly proposes an Aggregate Threshold Ring Signature (ATRS) algorithm, which is efficient, anonymous and takes up less space. Then we apply it to the consensus mechanism of blockchain, and proposes a consensus mechanism based on ATRS algorithm, named Ring Signature-Practical Byzantine Fault Tolerance (ATRS-PBFT) consensus mechanism. This consensus mechanism reduces the number of signatures and verifications and improves the efficiency of the mechanism. In order to increase the security, the consensus proposed in this paper also adopts a credit hierarchy in the master node election strategy, divides the nodes' credit rating before the master node election, and selects the nodes with high credit rating as the master nodes, which reduces the probability of malicious nodes becoming the master nodes. The optimized consensus mechanism can both achieve privacy protection for nodes using ring signature and reduce the data computation in the signature process to improve the efficiency of the mechanism. From the simulation experiments, it can be seen that ATRS-PBFT consensus has the advantages of increased throughput, reduced latency, short block-out time, and high efficiency compared with the traditional PBFT consensus mechanism.
科研通智能强力驱动
Strongly Powered by AbleSci AI