A Committee-Based Byzantine Consensus Protocol for Blockchain

Meng, Yuli; Cao, Zhao; Qu, Dacheng

doi:10.1109/icsess.2018.8663942

Cited by 16 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to Formula 2, we took 17 n  and 4 m  to draw Figure 2. It can be seen that the K value is almost equal to 0 in the interval [4,7] of the error tolerance number inferred from Part A of Section IV. The probability of all representative primary nodes being Byzantine nodes is very low.…”

Section: B the Probability That All Primary Nodes Are Byzantine Nodesmentioning

confidence: 91%

“…Therefore, there are many improved algorithms for PBFT in recent years. For example, literature [7][8][9][10] combines PBFT with a public chain consensus algorithm to improve consensus efficiency.The core idea is to select a certain number of nodes as committees through Proof-of-Work (PoW) [11], Proof-of-Stake (PoS) [12], and other algorithms, and then the committees generate blocks through the PBFT algorithm. This algorithm is usually suitable for token scenarios, but there is no token circulation in the actual alliance chain.…”

mentioning

confidence: 99%

“…This algorithm is usually suitable for token scenarios, but there is no token circulation in the actual alliance chain. Therefore, a series of Byzantine fault-tolerant algorithms based on credit mechanisms have been proposed [13][14][15][16][17][18][19][20][21][22][23][24]. The consensus nodes are screened through the reputation mechanism, and the consensus of the whole network is turned into the participation of some nodes or committees.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Improved Fault-Tolerant Consensus Based on the PBFT Algorithm

Yang

Jia

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. However, the PBFT algorithm is usually only applicable to small networks due to high communication complexity and poor scalability. Although there have been many improved algorithms for PBFT in recent years, they ignore fault tolerance and democracy. Therefore, to meet the requirements of a high degree of decentralization and fault tolerance of blockchainbased scenarios. This paper proposes a high fault tolerance consensus algorithm NBFT, which follows the principle of decentralization and democratization of blockchain and ensures the improvement of performance in fault tolerance upper limit and scalability. First, we use the consistent hash algorithm to group the consensus nodes to avoid much communication between nodes, reduce the communication complexity of the network, and improve the scalability of the network. Second, to ensure the fault-tolerant ability of the grouping consensus, the nodal decision broadcast model and threshold vote-counting model are proposed first. Combined with the proposed two models, the joint fault analysis of nodes is carried out, and the fault tolerance upper limit is more than 1/3. Then, the Faulty Number Determined(FND) model is introduced to simulate the experiment, and the results are verified.INDEX TERMS high fault tolerance; group consensus; scalability I. INTRODUCTION

show abstract

Section: B the Probability That All Primary Nodes Are Byzantine Nodesmentioning

confidence: 91%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Improved Fault-Tolerant Consensus Based on the PBFT Algorithm

Yang

Jia

et al. 2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Committee-based consensus is widely used in the blockchain space (Kogias et al 2016, Meng et al 2018a, Gleehokie et al 2018, TRON 2018, Cosmos 2021 Approval voting has been widely studied in the context of political elections (Brams and Fishburn 2007), and we highlight here some facts about the known dynamics of approval voting in general. In a k-winner election system, it is desirable to have the property that if a candidate is ranked first by at least n/k of the voters, then that candidate should be elected to the committee.…”

Section: Literature Reviewmentioning

confidence: 97%

“…, but the academic literature is arguably still lagging behind. Of the few studies we could find,Meng et al (2018b),Yang et al (2019), Hu et al (2021 examine related topics, but they focus mostly on hypothetical tweaks that could be added to improve existing systems. In contrast, we seek to formally analyze and understand whether the existing systems themselves are robust and efficient, given voters have limited information.Approval voting was introduced into the blockchain space in Delegated Proof of Stake (DPoS), and the first literature on DPoS started with practitioners, where it was often asserted that DPoS consensus is a more efficient and democratic version of the standard PoS mechanism(Binance 2020, Cryptopedia 2021).…”

mentioning

confidence: 99%

Scaling Blockchains: Can Committee-Based Consensus Help?

Benhaim¹,

Falk²,

Tsoukalas³

2021

Preprint

View full text Add to dashboard Cite

In the high-stakes race to develop more scalable blockchains, some platforms (Cosmos, EOS, TRON, etc.) have adopted committee-based consensus protocols, whereby the blockchain's record-keeping rights are entrusted to a committee of elected block producers. In theory, the smaller the committee, the faster the blockchain can reach consensus and the more it can scale. What's less clear, is whether this mechanism ensures that honest committees can be consistently elected, given voters typically have limited information. Using EOS' Delegated Proof of Stake (DPoS) protocol as a backdrop, we show that identifying the optimal voting strategy is complex and practically out of reach. We empirically characterize some simpler (suboptimal) voting strategies that token holders resort to in practice and show that these nonetheless converge to optimality, exponentially quickly. This yields efficiency gains over other PoS protocols that rely on randomized block producer selection. Our results suggest that (elected) committee-based consensus, as implemented in DPoS, can be robust and efficient, despite its complexity.

show abstract

Permissionless proof‐of‐reputation‐X: A hybrid reputation‐based consensus algorithm for permissionless blockchains

Abdo

Sibai

Demerjian

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Over the past years, blockchain technology has become more and more interesting since its ability to carry out transactions without any mediator. To ensure the transactions' reliability, consensus algorithms are adopted by blockchain technology. However, due to the failure of consensus algorithms in managing nodes' identities, blockchain technology is considered inappropriate for many applications. In this article, we propose the permissionless proof‐of‐reputation‐X (PL‐PoRX) that upgrades an existing consensus algorithm, the proof‐of‐reputation‐X (PoRX). PL‐PoRX replaces the trusted identity database in PoRX with a new admission process to make the algorithm suitable for permissionless blockchains, while maintaining PoRX's reputation mechanism. Several experiments are conducted to show the efficiency of our approach under different scenarios. We also debate the security model of the new protocol and study its time complexity. The results show that PL‐PoRX decreases the number of blocks issued by malicious miners, and help benign miners build reputation faster.

show abstract

A Committee-Based Byzantine Consensus Protocol for Blockchain

Cited by 16 publications

References 7 publications

Improved Fault-Tolerant Consensus Based on the PBFT Algorithm

Improved Fault-Tolerant Consensus Based on the PBFT Algorithm

Scaling Blockchains: Can Committee-Based Consensus Help?

Permissionless proof‐of‐reputation‐X: A hybrid reputation‐based consensus algorithm for permissionless blockchains

Contact Info

Product

Resources

About