Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Contest Between Simplicity and Efficiency in Asynchronous Byzantine
  Agreement   In the wake of the decisive impossibility result of Fischer, Lynch, and
Paterson for deterministic consensus protocols in the aynchronous model with
just one failure, Ben-Or and Bracha demonstrated that the problem could be
solved with randomness, even for Byzantine failures. Both protocols are natural
and intuitive to verify, and Bracha's achieves optimal resilience. However, the
expected running time of these protocols is exponential in general. Recently,
Kapron, Kempe, King, Saia, and Sanwalani presented the first efficient
Byzantine agreement algorithm in the asynchronous, full information model,
running in polylogarithmic time. Their algorithm is Monte Carlo and drastically
departs from the simple structure of Ben-Or and Bracha's Las Vegas algorithms.
  In this paper, we begin an investigation of the question: to what extent is
this departure necessary? Might there be a much simpler and intuitive Las Vegas
protocol that runs in expected polynomial time? We will show that the
exponential running time of Ben-Or and Bracha's algorithms is no mere accident
of their specific details, but rather an unavoidable consequence of their
general symmetry and round structure. We define a natural class of "fully
symmetric round protocols" for solving Byzantine agreement in an asynchronous
setting and show that any such protocol can be forced to run in expected
exponential time by an adversary in the full information model. We assume the
adversary controls $t$ Byzantine processors for $t = cn$, where $c$ is an
arbitrary positive constant $< 1/3$. We view our result as a step toward
identifying the level of complexity required for a polynomial-time algorithm in
this setting, and also as a guide in the search for new efficient algorithms.

12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
10
The categories of this paper are: q-bio