Ashish Choudhury
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.
- I. Abraham, D. Dolev, and J. Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM, 405--414.Google Scholar
- L. Bangalore, A. Choudhury, and A. Patra. 2020. The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM 67, 3 (2020), 1--59.Google ScholarDigital Library
- Z. Beerliová-Trubíniová, M. Hirt, and J. B. Nielsen. 2010. On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols. In PODC. ACM, 211--218.Google Scholar
- M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM, 27--30.Google Scholar
- G. Bracha. 1984. An Asynchronous [(n-1)/3]-Resilient Consensus Protocol. In PODC. ACM, 154--162.Google Scholar
- R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. ACM, 42--51.Google Scholar
- A. Choudhury, M. Hirt, and A. Patra. 2013. Asynchronous Multiparty Computation with Linear Communication Complexity. In DISC (Lecture Notes in Computer Science), Vol. 8205. Springer, 388--402.Google Scholar
- Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM, 148--161.Google Scholar
- M. J. Fischer, N. A. Lynch, and M. Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32, 2 (1985), 374--382.Google ScholarDigital Library
- A. Patra, A. Choudhury, and C. Pandu Rangan. 2014. Asynchronous Byzantine Agreement with Optimal Resilience. Distributed Computing 27, 2 (2014), 111--146.Google ScholarDigital Library
- A. Patra and D. Ravi. 2018. On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Information Theory 64, 6 (2018), 4207--4227.Google ScholarCross Ref
- Marshall Pease, Robert Shostak, and Leslie Lamport. 1980. Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM) 27, 2 (1980), 228--234.Google ScholarDigital Library
- Michael O. Rabin. 1983. Randomized Byzantine Generals. In FOCS. IEEE, 403--409.Google Scholar
- C. Wang. 2015. Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity. CoRR abs/1507.06165 (2015).Google Scholar
Recommendations
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingThe 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 ...
Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience ✱
ICDCN '23: Proceedings of the 24th International Conference on Distributed Computing and NetworkingIn this work, we present an almost-surely terminating asynchronous Byzantine agreement (ABA) protocol for n parties. Our protocol requires expected time and is secure against a computationally-unbounded malicious (Byzantine) adversary, characterized by ...
Asynchronous Byzantine Agreement with optimal resilience
We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting ...
Comments