Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP   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 (first in the
synchronous model and then with eventual-synchrony). 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 shared coin algorithm based on a VRF. 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
$\widetilde{O}(n)$ and $O(1)$ expected time, breaking the $O(n^2)$ bit barrier
for asynchronous Byzantine Agreement.

24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
34
The categories of this paper are: chem-ph
15
The categories of this paper are: nucl-ex
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics