CF-BFT:A Dual-Mode Byzantine Fault-Tolerant Protocol Based on Node Authentication

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.

T-PBFT: An EigenTrust-Based Practical Byzantine Fault Tolerance Consensus Algorithm

Blockchain with these characteristics of decentralized structure, transparent and credible, time-series and immutability, has been considering as a promising technology. Consensus algorithm as one of the core techniques of blockchain directly affects the scalability of blockchain systems. Existing probabilistic finality blockchain consensus algorithms such as PoW, PoS, suffer from power consumptions and low efficiency;while absolute finality blockchain consensus algorithms such as PBFT, HoneyBadgerBFT, could not meet the scalability requirement in a largescale network. In this paper, we propose a novel optimized practical Byzantine fault tolerance consensus algorithm based on EigenTrust model, namely T-PBFT, which is a multi-stage consensus algorithm. It evaluates node trust by the transactions between nodes so that the high quality of nodes in the network will be selected to construct a consensus group. To reduce the probability of view change, we propose to replace a single primary node with a primary group. By group signature and mutual supervision, we can enhance the robustness of the primary group further. Finally, we analyze T-PBFT and compare it with the other Byzantine fault tolerant consensus algorithms. Theoretical analysis shows that our T-PBFT can optimize the Byzantine fault-tolerant rate,reduce the probability of view change and communication complexity.

SBFT:A BFT Consensus Mechanism Based on DQN Algorithm for Industrial Internet of Thing

With the development and widespread use of blockchain in recent years,many projects have introduced blockchain technology to solve the growing security issues of the Industrial Internet of Things(IIoT).However,due to the conflict between the operational performance and security of the blockchain system and the compatibility issues with a large number of IIoT devices running together,the mainstream blockchain system cannot be applied to IIoT scenarios.In order to solve these problems,this paper proposes SBFT(Speculative Byzantine Consensus Protocol),a flexible and scalable blockchain consensus mechanism for the Industrial Internet of Things.SBFT has a consensus process based on speculation,improving the throughput and consensus speed of blockchain systems and reducing communication overhead.In order to improve the compatibility and scalability of the blockchain system,we select some nodes to participate in the consensus,and these nodes have better performance in the network.Since multiple properties determine node performance,we abstract the node selection problem as a joint optimization problem and use Dueling Deep Q Learning(DQL)to solve it.Finally,we evaluate the performance of the scheme through simulation,and the simulation results prove the superiority of our scheme.

A hierarchical byzantine fault tolerance consensus protocol for the Internet of Things

The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.

Excellent Practical Byzantine Fault Tolerance

With the rapid development of blockchain technology,more and more people are paying attention to the consensus mechanism of blockchain.Practical Byzantine Fault Tolerance(PBFT),as the first efficient consensus algorithm solving the Byzantine Generals Problem,plays an important role.But PBFT also has its problems.First,it runs in a completely closed environment,and any node can't join or exit without rebooting the system.Second,the communication complexity in the network is as high as O(n2),which makes the algorithm only applicable to small-scale networks.For these problems,this paper proposes an Optimized consensus algorithm,Excellent Practical Byzantine Fault Tolerance(EPBFT),in which nodes can dynamically participate in the network by combining a view change protocol with a node's add or quit request.Besides,in each round of consensus,the algorithm will randomly select a coordination node.Through the cooperation of the primary and the coordination node,we reduce the network communication complexity to O(n).Besides,we have added a reputation credit mechanism and a wrong node removal protocol to the algorithm for clearing the faulty nodes in time and improving the robustness of the system.Finally,we design experiments to compare the performance of the PBFT and EPBFT algorithms.Through experimental,we found that compared with the PBFT algorithm,the EPBFT algorithm has a lower delay,communication complexity,better scalability,and more practical.

Improved PBFT Consensus Algorithm Based on Node Role Division

The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.

A Systematic Literature Review on Blockchain Consensus Mechanisms’ Security: Applications and Open Challenges

This study conducts a systematic literature review(SLR)of blockchain consensus mechanisms,an essential protocols that maintain the integrity,reliability,and decentralization of distributed ledger networks.The aim is to comprehensively investigate prominent mechanisms’security features and vulnerabilities,emphasizing their security considerations,applications,challenges,and future directions.The existing literature offers valuable insights into various consensus mechanisms’strengths,limitations,and security vulnerabilities and their real-world applications.However,there remains a gap in synthesizing and analyzing this knowledge systematically.Addressing this gap would facilitate a structured approach to understanding consensus mechanisms’security and vulnerabilities comprehensively.The study adheres to Preferred Reporting Items for Systematic Reviews and Meta-Analyses(PRISMA)guidelines and computer science standards and reviewed 3749 research papers from 2016 to 2024,excluding grey literature,resulting in 290 articles for descriptive analysis.The research highlights an increased focus on blockchain consensus security,energy efficiency,and hybrid mechanisms within 60%of research papers post-2019,identifying gaps in scalability,privacy,and interoperability for future exploration.By synthesizing the existing research and identifying the key trends,this SLR contributes to advancing the understanding of blockchain consensus mechanisms’security and guiding future research and structured innovation in blockchain systems and applications.

Ripple+:An Improved Scheme of Ripple Consensus Protocol in Deployability,Liveness and Timing Assumption

Ripple acts as a real-time settlement and payment system to connect banks and payment providers.As the consensus support of the Ripple network to ensure network consistency,Ripple consensus protocol has been widely concerned in recent years.Compared with those Byzantine fault tolerant protocols,Ripple has a significant difference that the system can reach an agreement under decentralized trust model.However,Ripple has many problems both in theory and practice,which arementioned in the previous researches.This paper presents Ripple+,an improved scheme of Ripple consensus protocol,which improves Ripple fromthree aspects:(1)Ripple+employs a specific trustmodel and a corresponding guideline for Unique Node List selection,which makes it easy to deploy in practice to meet the safety and liveness condition;(2)the primary and viewchangemechanismare joined to solve the problem discussed by the previous research that Ripple may lose liveness in some extreme scenarios;(3)we remove the strong synchrony clock and timeout during consensus periods to make it suitable for weak synchrony assumption.We implemented a prototype of Ripple+and conducted experiments to show that Ripple+can achieve the throughput of tens of thousands of transactions per second with no more than half a minute latency,and the view change mechanism hardly incurs additional cost.

A Review: Consensus Algorithms on Blockchain

Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functions properly. In order to reach a consensus, it is critical to emphasize the importance of performance and efficiency. The use of the right consensus algorithm will significantly improve the efficiency of a blockchain application. This paper reviewed several types of consensus algorithms used in blockchain and discusses the idea of a new consensus algorithm that can improve the performance of consortium blockchain.

A Review of Consensus Protocols in Permissioned Blockchains

Consensus protocols are used for the distributed management of large databases in an environment without trust among participants.The choice of a specific protocol depends on the purpose and characteristics of the system itself.The subjects of the paper are consensus protocols in permissioned blockchains.The objective of this paper is to identify functional advantages and disadvantages of observed protocol.The analysis covers a total of six consensus protocols for permissioned blockchains.The following characteristics were compared:security,trust among participants,throughput and scalability.The results show that no protocol shows absolute dominance in all aspects of the comparison.Paxos and Raft are intended for systems in which there is no suspicion of unreliable users,but only the problem of a temporary shutdown.Practical Byzantine Fault Tolerance is intended for systems with a small number of nodes.Federated Byzantine Fault Tolerance shows better scalability and is more suitable for large systems,but can withstand a smaller number of malicious nodes.Proof-of-authority can withstand the largest number of malicious nodes without interfering with the functioning of the system.When choosing a consensus protocol for a blockchain application,one should take into account priority characteristics.

面向联盟链的共识算法研究

实用拜占庭容错算法(Practical Byzantine Fault Tolerance)广泛用于理论研究和实际生产中,但存在着选取主节点随机、缺乏惩罚机制等缺点.针对以上问题,(1)提出一种基于复杂网络角度的区块链共识算法,通过引入时间感知PageRank算法,建立区块链网络节点的影响力评分机制,并建立共识群组;(2)为了减少共识攻击的发生,建立节点惩罚机制,增加节点作恶的成本,有效提高攻击代价,降低攻击概率;(3)实验表明,基于时间感知PageRank的共识算法在扩展性和可靠性上高于实用拜占庭容错算法和基于信用分级的拜占庭容错算法(Credit-Layered Byzantine Fault Tolerance);在公平性和在延迟性方面,均取得良好效果.

基于Raft的多主节点拜占庭容错共识机制

为了解决联盟链中实用拜占庭容错(PBFT)共识机制在区块链网络中节点数量增多的情况下,通信复杂度高、共识效率低下等问题,本文提出一种基于Raft的多主节点拜占庭容错共识机制IMRBFT。IMRBFT通过Maglev一致性哈希算法对区块链网络节点均匀分组,将这个共识流程分成组外共识和组内共识2部分。组内先选出领导者节点,通过信用机制将节点分为3个等级:可信节点、普通节点和不可信节点。与投票机制共同降低恶意节点成为领导者节点的概率,并与其他组的领导者节点组成委员会,委员会再经过组外信用值机制选出信用值最高的多个主节点进行组外PBFT共识。组内共识在Raft共识的基础上引入监管节点与中继节点,进一步提升安全性与共识效率,减少恶意节点的作恶行为。实验结果表明:IMRBFT的通信开销为线性增长,通信量为PBFT的41.6%,吞吐量为PBFT的4.2倍,共识延时降低76.4%。随着节点增多,优化更加明显,完全满足大型区块链网络的通信复杂度小、吞吐量高、共识延时短、安全性与共识效率高的要求。

基于信誉机制的改进PBFT共识算法

针对实用拜占庭容错共识算法(practical Byzantine fault tolerant,PBFT)通信开销大和缺乏奖惩机制的问题,提出一种基于信誉机制的改进PBFT共识算法RPBFT(reputed practical Byzantine fault tolerance)。首先,引入信誉机制对节点评分,将参与共识的节点分为收集器节点和普通共识节点,并对恶意节点进行惩罚。其次,收集器节点负责收集普通共识节点的投票消息,避免普通共识节点之间的通信,从而降低通信开销。最后,当普通共识节点中的拜占庭节点均无恶意行为时,通过增加收集所需的投票数量,减少一次投票收集过程,实现快速共识。实验结果表明,RPBFT能够有效地发现恶意节点并对其作出惩罚,同时具有更低的通信开销、平均共识时延以及更高的共识吞吐量。当节点总数为37时,与SBFT相比,RPBFT将平均共识时延降低25.2%以上,并将共识吞吐量提高39%以上。

GBFT:一种实用拜占庭容错算法改进方案

区块链技术近年来成为研究热点,在金融、物流等行业已经有联盟链的落地案例。共识算法作为区块链的核心技术,将对区块链的整体性能产生直接影响。应用于联盟链的实用拜占庭容错算法(Practical Byzantine Fault Tolerance,PBFT)仍然存在着交易确认时间长、吞吐量低等问题。面向联盟链应用场景,基于PBFT算法,引入了非拜占庭容错协议,结合基于节点行为的选举机制,提出了三级共识机制的PBFT:GBFT。最后从吞吐量、交易确认时延、容错性等方面对GBFT方案和原始PBFT算法进行了对比实验与分析。实验结果表明,GBFT保持了PBFT算法1/3的容错性,有效提高了吞吐量,降低了交易确认时延。

一种基于双链的区块链共识机制

共识机制是区块链系统的核心技术,目前针对“非币”区块链系统提出的基于贡献值证明与工作量证明(Po C+Po W)的共识机制存在共识效率较低、可靠性和安全性不高、算力消耗大的缺点。提出一种新的基于双链的共识机制CON_DC_PBFT。在该共识机制中设计一种业务链-系统链双链结构,将贡献值等系统数据和主要业务数据分离到双链中各自完成共识处理,双链的共识表现为半独立的形式,业务链共识消息流受系统链监督协调,并且系统链根据贡献值随机指定业务链的记账节点,双链的分工与协同实现并行化和流水化,改善共识的效率。由于贡献值数据不能被轻易获取,通过拜占庭通信机制和节点随机选择算法,降低节点遭受攻击和系统停滞的风险。通过实验综合分析出块选择概率、单点故障率、节点数、区块传输速率、CPU使用率对共识机制的性能影响,结果表明,与Po C+Po W机制相比,CON_DC_PBFT共识机制节省了50%以上内存、存储资源占用,在综合共识时延上有30%以上的改善。

基于奖励积分机制的高效拜占庭容错算法DIG-PBFT

实用拜占庭容错共识算法(PBFT)作为联盟链中最常见的共识算法,可以在恶意节点少于三分之一的情况下,保证系统的正确性.然而,PBFT算法在建立信任与共识过程中存在高时延、低吞吐量、主节点选取安全性、恶意节点未处理等问题.为了解决这些问题,引入奖励积分机制来对共识节点进行分组并设定候选节点集,提出了一种高效快速的拜占庭容错算法(DIG-PBFT).在共识过程中,DIG-PBFT通过动态地调整实际参与共识的节点,增加了安全性更高节点的参与度.仿真实验结果表明:与PBFT算法及其同类工作相比,DIG-PBFT算法的吞吐量更大、时延更低,且安全性更高.

基于节点动态评分机制的分组共识算法

针对实用拜占庭容错(practical Byzantine fault tolerance,PBFT)共识算法三阶段流程通信开销大,主节点随机选取且缺乏奖惩机制等问题,提出基于节点动态评分机制的分组共识算法(dynamic scoring practical Byzantine fault tolerance,DS-PBFT)。首先,优化一致性协议,简化三阶段通信流程从而提高共识效率;其次,提出节点评分分组机制,通过节点在共识过程中的历史行为进行评分,并分为共识组和候选组,降低恶意节点参与共识过程的可能性;最后,提出动态过程选择参与共识的节点,优化视图切换协议和垃圾回收机制,减少参与共识的节点数量,从根本上提高共识效率。用Docker容器模拟多个节点的仿真实验表明,在网络稳定、可信节点较多的联盟链中,提出的DS-PBFT共识算法在共识时延、吞吐量、容错性和通信复杂度等方面比PBFT共识算法及其他改进算法相比具有更好的性能,能够快速达成共识,提高共识效率。

CS-Raft:适用于联盟链的拜占庭容错共识算法

针对目前联盟链共识算法的性能不足,提出了一种基于信用评分的可拜占庭容错联盟链共识算法CS-Raft。首先,为所有节点赋予信用评分属性,节点的信用评分根据节点的共识行为、活跃度、加入集群时间等指标进行更新,信用评分越高代表节点可信度越高;其次,根据节点信用评分选取监督节点,监督节点具有检验权,可以参与领导人选举,监督节点的设置可以有效抵抗拜占庭恶意节点的攻击;最后,改善了领导人选举中选票分裂问题,对领导人选举的速度进行提升。经实验分析,CS-Raft算法相较于PBFT算法在实现拜占庭容错的同时,有效地减少了共识时间延迟、提高了系统吞吐量,并加快了其领导人选举速度。

低时延的拜占庭容错共识机制

为适应能源互联网区块链系统等对实时性要求高的场景,以进一步降低HotStuff共识机制的出块时延为研究方向,针对乐观情况和拜占庭故障情况,提出了新的HotStream共识机制,设计了相应的稳态视图协议和容错视图协议。主节点在选择父区块时参考了提案消息和投票消息,确保不会因为拜占庭故障而遗漏区块提案。在不增加通信复杂度的情况下,HotStream减少了平均提交区块提案所需的视图数量,进而降低了出块时延。实验结果表明,乐观情况下HotStream的出块时延与HotStuff相比平均降低了33%,发生拜占庭故障的情况下出块时延平均降低了68%。

基于路径存储表的Hashgraph共识算法优化与实现

Hashgraph是一种数据采用有向无环图(DAG)结构的区块链共识算法,Hashgraph引入了虚拟投票的概念,允许节点在无额外通信开销的情况下并发出块,实现异步场景下的拜占庭容错。然而,Hashgraph提出的虚拟投票算法存在算法时间复杂度较高、共识运行逻辑过于复杂等问题。为此,提出一种基于路径存储表的Hashgraph优化方案。首先,提出一种基于顶点可达表的见证人判定方法,通过存储路径的方式实时记录生成事件与历史事件的可达关系,在轮次划分阶段,通过查询顶点事件的可达信息取代回溯算法,降低见证人判断算法的时间复杂度;其次,针对顶点可达表无法跨轮次判断事件关系的问题,提出一种基于历史可达表的知名见证人判定方法,历史可达表将存储见证人与历史事件之间的可达关系,通过查询历史可达表解决知名见证人判定阶段需要反复回溯视图的问题;最后,根据顶点可达表和历史可达表改进Hashgraph中复杂的共识计算,提升算法效率,加快事件确认速度。实验结果表明,所提优化方案与Hashgraph原共识算法相比,算法运行效率提升65.76%,在吞吐量方面平均提升41.27%。