Subquadratic Multivalued Asynchronous Byzantine Agreement WHP

TL;DR

This paper introduces a novel subquadratic communication protocol for multivalued asynchronous Byzantine agreement, filling a longstanding gap in the literature by extending binary consensus techniques to multivalued settings.

Contribution

It presents the first subquadratic communication complexity solution for multivalued asynchronous Byzantine agreement, leveraging new binary agreement methods.

Findings

Achieves subquadratic communication complexity

Extends binary Byzantine agreement techniques to multivalued consensus

Closes a 20-year gap in asynchronous Byzantine agreement research

Abstract

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.