research-article

Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience

Authors:

Ittai Abraham,

Danny Dolev,

Gilad SternAuthors Info & Claims

PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

Pages 139 - 148

https://doi.org/10.1145/3382734.3405722

Published: 31 July 2020 Publication History

Get Access

Abstract

The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience against a Byzantine adversary: if n ≤ 4t then any t-resilient asynchronous verifiable secret sharing protocol must have some non-zero probability of not terminating.

Our main contribution is to revisit this lower bound and provide a rigorous and more general proof. Our second contribution is to show how to avoid this lower bound. We provide a protocol with optimal resilience that is almost surely terminating for a strong common coin functionality. Using this new primitive we provide an almost surely terminating protocol with optimal resilience for asynchronous Byzantine agreement that has a new fair validity property. To the best of our knowledge this is the first asynchronous Byzantine agreement with fair validity in the information theoretic setting.

References

[1]

Ittai Abraham, Danny Dolev, Rica Gonen, and Joe Halpern. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '06, page 53--62, New York, NY, USA, 2006. Association for Computing Machinery.

Digital Library

Google Scholar

[2]

Ittai Abraham, Danny Dolev, and Joseph Y. Halpern. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, PODC '08, page 405--414, New York, NY, USA, 2008. Association for Computing Machinery.

Digital Library

Google Scholar

[3]

Michael Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, PODC '83, 1983.

Digital Library

Google Scholar

[4]

Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC '93, page 52--61, New York, NY, USA, 1993. Association for Computing Machinery.

Digital Library

Google Scholar

[5]

Michael Ben-Or, Boaz Kelmer, and Tal Rabin. Asynchronous secure computations with optimal resilience (extended abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '94, page 183--192, New York, NY, USA, 1994. Association for Computing Machinery.

Digital Library

Google Scholar

[6]

Gabriel Bracha. Asynchronous byzantine agreement protocols. Inf. Comput., 75(2):130--143, November 1987.

Digital Library

Google Scholar

[7]

Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC '93, pages 42--51, New York, NY, USA, 1993. ACM.

Digital Library

Google Scholar

[8]

Michael J. Fischer, Nancy A. Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC '85, page 59--70, New York, NY, USA, 1985. Association for Computing Machinery.

Digital Library

Google Scholar

[9]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374--382, April 1985.

Digital Library

Google Scholar

Cited By

View all

Choudhury A(2024)Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal ResilienceTheoretical Computer Science10.1016/j.tcs.2024.114492(114492)Online publication date: Mar-2024
https://doi.org/10.1016/j.tcs.2024.114492
Goyal VLiu-Zhang CSong Y(2024)Towards Achieving Asynchronous MPC with Linear Communication and Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_6(170-206)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_6
Ji XLi JSong Y(2024)Linear-Communication Asynchronous Complete Secret Sharing with Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_13(418-453)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_13
Show More Cited By

Recommendations

Revisiting asynchronous fault tolerant computation with optimal resilience
Abstract
The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not ...
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 ...
Simple and efficient asynchronous byzantine agreement with optimal resilience
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary A_t with unbounded computing power actively controls at most t = ([n/3] − 1) out of n parties in Byzantine ...

Comments

Information & Contributors

Information

Published In

PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

July 2020

539 pages

ISBN:9781450375825

DOI:10.1145/3382734

General Chair:
Yuval Emek
Technion, Israel
,
Program Chair:
Christian Cachin
University of Bern, Switzerland

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

HUJI Federnann Cyber Security Research Center

Conference

PODC '20

Sponsor:

PODC '20: ACM Symposium on Principles of Distributed Computing

August 3 - 7, 2020

Virtual Event, Italy

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
196
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Choudhury A(2024)Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal ResilienceTheoretical Computer Science10.1016/j.tcs.2024.114492(114492)Online publication date: Mar-2024
https://doi.org/10.1016/j.tcs.2024.114492
Goyal VLiu-Zhang CSong Y(2024)Towards Achieving Asynchronous MPC with Linear Communication and Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_6(170-206)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_6
Ji XLi JSong Y(2024)Linear-Communication Asynchronous Complete Secret Sharing with Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_13(418-453)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_13
Bruni RGiacobazzi RGori RRanzato F(2023)A Correctness and Incorrectness Program LogicJournal of the ACM10.1145/358226770:2(1-45)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3582267
Charalampopoulos PGawrychowski PLong YMozes SPettie SWeimann OWulff-Nilsen C(2023)Almost Optimal Exact Distance Oracles for Planar GraphsJournal of the ACM10.1145/358047470:2(1-50)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3580474
Geffner IHalpern J(2023)Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious AgentsJournal of the ACM10.1145/357857970:2(1-21)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3578579
Appan AChandramouli AChoudhury A(2023)Perfectly-Secure Synchronous MPC With Asynchronous Fallback GuaranteesIEEE Transactions on Information Theory10.1109/TIT.2023.326444469:8(5386-5425)Online publication date: Aug-2023
https://doi.org/10.1109/TIT.2023.3264444
Appan AChandramouli AChoudhury A(2023)Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General AdversariesJournal of Cryptology10.1007/s00145-023-09457-336:3Online publication date: 24-Apr-2023
https://dl.acm.org/doi/10.1007/s00145-023-09457-3
Choudhury APatra A(2023)On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal ResilienceJournal of Cryptology10.1007/s00145-023-09451-936:2Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1007/s00145-023-09451-9
Appan AChoudhury A(2023)Network Agnostic MPC with Statistical SecurityTheory of Cryptography10.1007/978-3-031-48618-0_3(63-93)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-48618-0_3
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations