Validated Byzantine Asynchronous Multidimensional Approximate Agreement

by   Maya Dotan, et al.

Consider an asynchronous system where each node begins with some point in ℝ^m. Given some fixed ϵ > 0, we wish to have every nonfaulty node eventually output a point in ℝ^m, where all outputs are within distance ϵ of each other, and are within the convex hull of the original nonfaulty inputs. This problem, when some of the nodes are adversarial, is known as the “Byzantine Asynchronous Multidimensional Approximate Agreement” problem. Previous landmark work by Mendes et al. and Vaidya et al. presented two solutions to the problem. Both of these solutions require exponential computation by each node in each round. Furthermore, the work provides a lower bound showing that it is impossible to solve the task of approximate agreement if n≤ (m+2)t, and thus the protocols assume that n>(m+2)t. We present a Byzantine Asynchronous Multidimensional Approximate Agreement protocol in the validated setting of Cachin et al. Our protocol terminates after a logarithmic number of rounds, and requires only polynomial computation in each round. Furthermore, it is resilient to t<n/3 Byzantine nodes, which we prove to be optimal in the validated setting. In other words, working on the task in the validated setting allows us to significantly improve on previous works in several significant metrics. In addition, the techniques presented in this paper can easily yield a protocol in the original non-validated setting which requires exponential computation only in the first round, and polynomial computation in every subsequent round.


page 1

page 2

page 3

page 4


Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication

We provide a new protocol for Validated Asynchronous Byzantine Agreement...

Cob: a Multidimensional Byzantine Agreement Protocol for Asynchronous Incomplete Networks

In this paper we extend the Multidimensional Byzantine Agreement (MBA) P...

Byzantine Agreement in Polynomial Time with Near-Optimal Resilience

It has been known since the early 1980s that Byzantine Agreement in the ...

Byzantine Lattice Agreement in Synchronous Systems

In this paper, we study the Byzantine lattice agreement problem in synch...

On the Round Complexity of Randomized Byzantine Agreement

We prove lower bounds on the round complexity of randomized Byzantine ag...

Topological Characterization of Task Solvability in General Models of Computation

The famous asynchronous computability theorem (ACT) relates the existenc...

Distributed Randomness from Approximate Agreement

Randomisation is a critical tool in designing distributed systems. The c...

Please sign up or login with your details

Forgot password? Click here to reset