Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

02/16/2020
by   Shir Cohen, et al.
0

King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience in the eventual-synchrony model. Yet the question of asynchronous sub-quadratic Byzantine Agreement remained open. To the best of our knowledge, we are the first to answer this question in the affirmative. A key component of our solution is a novel shared coin algorithm based on a VRF, without any further trusted setup. A second essential ingredient is VRF-based committee sampling, which we formalize and utilize in the asynchronous model for the first time. Our algorithms work against a delayed-adaptive adversary, which cannot perform after-the-fact removals but has full control of Byzantine processes and full information about communication in earlier rounds. Using committee sampling and our shared coin, we solve Byzantine Agreement with high probability, with a word complexity of O(n) and O(1) expected time, breaking the O(n^2) bit barrier for asynchronous Byzantine Agreement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/05/2023

Subquadratic Multivalued Asynchronous Byzantine Agreement WHP

There have been several reductions from multivalued consensus to binary ...
research
11/04/2018

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

We provide a new protocol for Validated Asynchronous Byzantine Agreement...
research
06/30/2022

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

Since the mid-1980s it has been known that Byzantine Agreement can be so...
research
02/18/2022

Make Every Word Count: Adaptive BA with Fewer Words

Byzantine Agreement is a key component in many distributed systems. Whil...
research
12/25/2018

Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016

This is a brief correction by the authors to "Byzantine Agreement in Exp...
research
02/27/2022

Byzantine Agreement in Polynomial Time with Near-Optimal Resilience

It has been known since the early 1980s that Byzantine Agreement in the ...
research
08/07/2023

Strong Byzantine Agreement with Adaptive Word Complexity

The strong Byzantine agreement (SBA) problem is defined among n processe...

Please sign up or login with your details

Forgot password? Click here to reset