Subquadratic Multivalued Asynchronous Byzantine Agreement WHP

08/05/2023
by   Shir Cohen, et al.
0

There have been several reductions from multivalued consensus to binary consensus over the past 20 years. To the best of our knowledge, none of them solved it for Byzantine asynchronous settings. In this paper, we close this gap. Moreover, we do so in subquadratic communication, using newly developed subquadratic binary Byzantine Agreement techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2020

Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

King and Saia were the first to break the quadratic word complexity boun...
research
05/24/2022

Distributed Randomness from Approximate Agreement

Randomisation is a critical tool in designing distributed systems. The c...
research
12/13/2021

Swarm consensus

The strength of gnomes lies in their coordinated action. Being small and...
research
11/03/2021

Byzantine Agreement with Less Communication: Recent Advances

In recent years, Byzantine Agreement is being considered in increasing s...
research
04/20/2020

Asynchronous Byzantine Approximate Consensus in Directed Networks

In this work, we study the approximate consensus problem in asynchronous...
research
02/20/2021

Byzantine Agreement with Unknown Participants and Failures

A set of mutually distrusting participants that want to agree on a commo...
research
10/13/2019

Byzantine Generalized Lattice Agreement

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

Please sign up or login with your details

Forgot password? Click here to reset