Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present almost-surely terminating asynchronous Byzantine agreement (ABA) protocols with a constant expected running time, in two different settings. The first protocol is in a completely asynchronous setting and has non-optimal resilience, outperforming the communication complexity of all the existing protocols in the asynchronous setting. The second protocol has optimal resilience and considers a hybrid setting for the first time, where the parties are available with one synchronous round at the beginning of the protocol execution, after which the network is completely asynchronous.

Cite

CITATION STYLE

APA

Choudhury, A. (2020). Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 169–171). Association for Computing Machinery. https://doi.org/10.1145/3382734.3404503

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free