Paper 2018/394
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
Laasya Bangalore, Ashish Choudhury, and Arpita Patra
Abstract
The problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in the asynchronous network setting encounters inevitable non-termination issues. The impasse is overcome via randomization that allows construction of BA protocols in two flavours of termination guarantee -- with overwhelming probability and with probability one. The latter type termed as almost-surely terminating BAs are the focus of this paper. An eluding problem in the domain of almost-surely terminating BAs is achieving a constant expected running time. Our work makes progress in this direction.
In a setting with
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Major revision. PODC 2018
- Contact author(s)
- ashish choudhury @ iiitb ac in
- History
- 2018-05-01: received
- Short URL
- https://ia.cr/2018/394
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/394, author = {Laasya Bangalore and Ashish Choudhury and Arpita Patra}, title = {Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/394}, year = {2018}, url = {https://eprint.iacr.org/2018/394} }