Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Byzantine Lattice Agreement in Asynchronous Systems   We study the Byzantine lattice agreement (BLA) problem in asynchronous
distributed message passing systems. In the BLA problem, each process proposes
a value from a join semi-lattice and needs to output a value also in the
lattice such that all output values of correct processes lie on a chain despite
the presence of Byzantine processes. We present an algorithm for this problem
with round complexity of $O(\log f)$ which tolerates $f < \frac{n}{5}$
Byzantine failures in the asynchronous setting without digital signatures,
where $n$ is the number of processes. We also show how this algorithm can be
modified to work in the authenticated setting (i.e., with digital signatures)
to tolerate $f < \frac{n}{3}$ Byzantine failures.

28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat