Fair Byzantine Agreements for Blockchains

Abstract

The Byzantine general problem is the core problem that consensus algorithms are trying to solve, which is at the heart of the design of blockchains. As a result, we have seen numerous proposals of consensus algorithms in recent years, trying to improve the level of decentralization, performance, and security of blockchains. In our opinion, there are two most challenging issues when we consider the design of such algorithms in the context of powering blockchains in practice. First, the outcome of a consensus algorithm usually depends on the underlying incentive model, so each participant should have an equal probability of receiving rewards for its work. Secondly, the protocol should be able to resist network failures, such as cloud services shutdown, while maintaining high performance otherwise. We address these two critical issues in this paper. First, we propose a new metric, called fair validity, for measuring the performance of Byzantine agreements. Intuitively, fair validity provides a lower bound for the probability of acceptances of honest nodes' proposals. This is a strong notion of fairness, and we argue that it is crucial for the success of a blockchain in practice. We then show that any Byzantine agreement could not achieve fair validity in an asynchronous network, so we will focus on synchronous protocols. This leads to our second contribution: we propose a fair, responsive, and partition-resilient Byzantine agreement protocol able to tolerate up to 1/3 corruptions. As we will show in the paper, our protocol achieves fair validity and is responsive in the sense that the termination time only depends on actual network delay, as opposed to arbitrary, predetermined time-bound. Furthermore, our proposal is partition-resilient. Last but not least, experimental results show that our Byzantine agreement protocol outperforms a wide variety of state-of-art synchronous protocols, combining the best from both theoretic and practical worlds.

Improving Election Integrity: Blockchain and Byzantine Generals Problem Theory in Vote Systems

“…This issue emphasizes the intricacy of distributed systems as well as the value of dependability and trust in cooperative settings. Kuo et al [11] contribute to this area by proposing a fair Byzantine agreement protocol that addresses the fairness and performance issues in blockchain consensus. Their work is particularly relevant to BBVV as it ensures that each participant's value has an equal probability of being selected, which is essential for trust in voting processes.…”

Enhancing the Reliability of Cellular Internet of Things through Agreement

“…With the agreement, many applications can be implemented, such as the task of locating the location of the copied files in a distributed environment [12,13], a two-phase commitment can be made in the distributed database system [14,15] and the landing task controlled by the flight control system [16,17]. The agreement problem has been also studied and applied extensively in diverse areas including control systems, optimization, distributed computing, and emerging areas such as robotics, blockchain, and IoT [18,19]. In addition, many applications of CIoT provide users with convenience.…”