Subquadratic Multivalued Asynchronous Byzantine Agreement WHP
pith:JPMKC22Qopen to challenge →
classification
cs.DC
keywords
byzantinesubquadraticagreementasynchronousbinaryconsensusmultivaluedbeen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.