Article

Free access

Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

Author:

Michael Ben-OrAuthors Info & Claims

PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing

August 1983

Pages 27 - 30

https://doi.org/10.1145/800221.806707

Published: 17 August 1983 Publication History

PDF eReader

Abstract

Recently, Fischer, Lynch and Paterson [3] proved that no completely asynchronous consensus protocol can tolerate even a single unannounced process death. We exhibit here a probabilistic solution for this problem, which guarantees that as long as a majority of the processes continues to operate, a decision will be made (Theorem 1). Our solution is completely asynchronous and is rather strong: As in [4], it is guaranteed to work with probability 1 even against an adversary scheduler who knows all about the system.

References

[1]

Dolev, D. and Strong, R. Polynomial Algorithms for Byzantine Agreement. Proc. 14th ACM Symp. on Theory of Computing (1982), 401-407.

Digital Library

Google Scholar

[2]

Fischer, M. and Lynch, N. A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters 14, 4 (1982), 182-186.

Crossref

Google Scholar

[3]

Fischer, M., Lynch, N. and Paterson, M. Impossibility of Distributed Consensus With One Faulty Process. MIT/LCS/TR-282.

Digital Library

Google Scholar

[4]

Lehman, D. and Rabin, M. On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. to appear.

Google Scholar

Cited By

View all

Dong HLiu S(2024)Asynchronous Consensus Quorum Read: Pioneering Read Optimization for Asynchronous Consensus ProtocolsElectronics10.3390/electronics1303048113:3(481)Online publication date: 23-Jan-2024
https://doi.org/10.3390/electronics13030481
Song AZhou C(2024)FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT ProtocolApplied Sciences10.3390/app1404146114:4(1461)Online publication date: 10-Feb-2024
https://doi.org/10.3390/app14041461
Mostefaoui APerrin MWeibel JKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail!Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662824(36-39)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662824
Show More Cited By

Index Terms

Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials
2. Theory of computation
  1. Models of computation
    1. Probabilistic computation

Recommendations

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)
Progress in Cryptology – INDOCRYPT 2020
Abstract
We study perfectly-secure Multiparty Computation (MPC) in the asynchronous communication setting, tolerating a generalized non-threshold adversary, characterized by an adversary structure. Ashwin Kumar et al. (ACISP2002) presented a condition ...
Read More
High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract)
Progress in Cryptology – INDOCRYPT 2020
Abstract
We study secure multi-party computation (MPC) among small number of parties, in partially synchronous and completely asynchronous settings. Prior works have only considered the synchronous setting. The setting considered in this paper is that of $n =...$
Read More
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
Theory of Cryptography
Abstract
We study information-theoretic secure multiparty protocols that achieve full security, including guaranteed output delivery, at the presence of an active adversary that corrupts a constant fraction of the parties. It is known that 2 rounds are ...
Read More

Comments

Information & Contributors

Information

Published In

PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing

August 1983

305 pages

ISBN:0897911105

DOI:10.1145/800221

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 ACM 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: 17 August 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

437
Total Citations
View Citations
4,672
Total Downloads

Downloads (Last 12 months)515
Downloads (Last 6 weeks)54

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dong HLiu S(2024)Asynchronous Consensus Quorum Read: Pioneering Read Optimization for Asynchronous Consensus ProtocolsElectronics10.3390/electronics1303048113:3(481)Online publication date: 23-Jan-2024
https://doi.org/10.3390/electronics13030481
Song AZhou C(2024)FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT ProtocolApplied Sciences10.3390/app1404146114:4(1461)Online publication date: 10-Feb-2024
https://doi.org/10.3390/app14041461
Mostefaoui APerrin MWeibel JKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail!Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662824(36-39)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662824
Huang SPettie SZhu L(2024)Byzantine Agreement with Optimal Resilience via Statistical Fraud DetectionJournal of the ACM10.1145/363945471:2(1-37)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3639454
Giuliari GSonnino AFrei MStreun FKokoris-Kogias LPerrig AQuek TGao DZhou JCardenas A(2024)An Empirical Study of Consensus Protocols’ DoS ResilienceProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3656997(1345-1360)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3656997
Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Zarnstorff JLebow LRemuck DRuiz CTseng LAgrawal KPetrank E(2024)Brief Announcement: Racos: A Leaderless Erasure Coding State Machine ReplicationProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3660273(379-381)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3660273
Yang GChen CChen QJiang JLi JHe D(2024)Sweeper: Breaking the Validity-Latency Tradeoff in Asynchronous Common SubsetIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.338260219(4534-4546)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3382602
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
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)

High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract)

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)