DeepAI AI Chat
Log In Sign Up

Byzantine Lattice Agreement in Asynchronous Systems

by   Xiong Zheng, et al.
The University of Texas at Austin

We study the Byzantine lattice agreement (BLA) problem in asynchronous distributed message passing systems. In the BLA problem, each process proposes a value from a join semi-lattice and needs to output a value also in the lattice such that all output values of correct processes lie on a chain despite the presence of Byzantine processes. We present an algorithm for this problem with round complexity of O(log f) which tolerates f < n/5 Byzantine failures in the asynchronous setting without digital signatures, where n is the number of processes. We also show how this algorithm can be modified to work in the authenticated setting (i.e., with digital signatures) to tolerate f < n/3 Byzantine failures.


page 1

page 2

page 3

page 4


Synchronous Byzantine Lattice Agreement in O(log (f)) Rounds

In the Lattice Agreement (LA) problem, originally proposed by Attiya et ...

Byzantine Generalized Lattice Agreement

The paper investigates the Lattice Agreement (LA) problem in asynchronou...

On implementing SWMR registers from SWSR registers in systems with Byzantine failures

The implementation of registers from (potentially) weaker registers is a...

Byzantine Approximate Agreement on Graphs

Consider a distributed system with n processors out of which f can be By...

Amortized Constant Round Atomic Snapshot in Message-Passing Systems

We study the lattice agreement (LA) and atomic snapshot problems in asyn...

Asynchronous Reconfiguration with Byzantine Failures

Replicated services are inherently vulnerable to failures and security b...

On Probabilistic Byzantine Fault Tolerance

Byzantine fault tolerance (BFT) has been extensively studied in distribu...