eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-01-25
4:1
4:16
10.4230/LIPIcs.OPODIS.2020.4
article
Byzantine Lattice Agreement in Asynchronous Systems
Zheng, Xiong
1
Garg, Vijay
1
Electrical and Computer Engineering, University of Texas at Austin, TX, USA
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 < n/5 Byzantine failures in the asynchronous setting without digital signatures, where n is the number of processes. This is the first algorithm which has logarithmic round complexity for this problem in asynchronous setting. Before our work, Di Luna et al give an algorithm for this problem which takes O(f) rounds and tolerates f < n/3 Byzantine failures. We also show how this algorithm can be modified to work in the authenticated setting (i.e., with digital signatures) to tolerate f < n/3 Byzantine failures.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol184-opodis2020/LIPIcs.OPODIS.2020.4/LIPIcs.OPODIS.2020.4.pdf
Byzantine Lattice Agreement
Asynchronous