Fair Byzantine Agreements for Blockchains

07/08/2019
by   Tzu-Wei Chao, et al.
0

Byzantine general problem is the core problem of the consensus algorithm, and many protocols are proposed recently to improve the decentralization level, the performance and the security of the blockchain. There are two challenging issues when the blockchain is operating in practice. First, the outcomes of the consensus algorithm are usually related to the incentive model, so whether each participant's value has an equal probability of being chosen becomes essential. However, the issues of fairness are not captured in the traditional security definition of Byzantine agreement. Second, the blockchain should be resistant to network failures, such as cloud services shut down or malicious attack, while remains the high performance most of the time. This paper has two main contributions. First, we propose a novel notion called fair validity for Byzantine agreement. Intuitively, fair validity lower-bounds the expected numbers that honest nodes' values being decided if the protocol is executed many times. However, we also show that any Byzantine agreement could not achieve fair validity in an asynchronous network, so we focus on synchronous protocols. This leads to our second contribution: we propose a fair, responsive and partition-resilient Byzantine agreement protocol tolerating up to 1/3 corruptions. Fairness means that our protocol achieves fair validity. Responsiveness means that the termination time only depends on the actual network delay instead of depending on any pre-determined time bound. Partition-resilience means that the safety still holds even if the network is partitioned, and the termination will hold if the partition is resolved.

READ FULL TEXT
research
06/30/2020

Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience

The celebrated result of Fischer, Lynch and Paterson is the fundamental ...
research
08/08/2023

Gorilla: Safe Permissionless Byzantine Consensus

Nakamoto's consensus protocol works in a permissionless model and tolera...
research
01/28/2019

Blockchain Trilemma Solver Algorand has Dilemma over Undecidable Messages

Recently, an ingenious protocol called Algorand has been proposed to ove...
research
11/30/2020

Security Analysis of Ripple Consensus

The Ripple network is one of the most prominent blockchain platforms and...
research
07/26/2019

Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0

In this paper we present an open source, fully asynchronous, leaderless ...
research
08/07/2019

A Generic Efficient Biased Optimizer for Consensus Protocols

Consensus is one of the most fundamental distributed computing problems....
research
06/10/2019

FairLedger: A Fair Blockchain Protocol for Financial Institutions

Financial institutions are currently looking into technologies for permi...

Please sign up or login with your details

Forgot password? Click here to reset