Article

Free access

Fast asynchronous Byzantine agreement with optimal resilience

Authors:

Tal RabinAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 42 - 51

https://doi.org/10.1145/167088.167105

Published: 01 June 1993 Publication History

First page of PDF

References

[1]

H. Attiya and M. Mavronicolas, "Efficiency of Semi, Synchronous versus Asynchronous Networks," Mathematical Systems Theory, to appear. Preliminary version in proceedings of the 28th annual Allerton Conference on Communication, Control and Computing, October 1990, pp. 578-587.

[2]

M. Ben-Or, R. Canetti and O. Goldreich, "Asynchronous Secure Computations", submitted to these proceedings.

Digital Library

[3]

M. Ben-Or and R. EI-Yaniv, "Interactive Consistency in Constant Time", submitted for publication, 1991

[4]

M. Ben-Or, S. Goldwasser and A. Wigderson, " Completeness Theorems for Non-Cryptographic Fault- Tolerant Distributed Computation", 20th STOC, pp. 1-10, 1988.

Digital Library

[5]

G. Bracha, "An Asynchronous {(n- 1)/3J-resilient Consensus Protocol", 3rd PODC, pp. 154-162, 1984.

Digital Library

[6]

R. Canetti, and T. Rabin, "Optimal Asynchronous Byzantine Agreement", Technical Report #92-15, CS Department, Hebrew University, 1992.

[7]

D. Chaum, C. Crepeau and i. Damgard, "Multiparty Unconditionally Secure Protocols", 20th STOC, pp. 11-19, 1988.

Digital Library

[8]

B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults", 26th FOCS, pp. 383-395, 1985.

Digital Library

[9]

B. Chor and C. Dwork, "Randomization in Bysantine Agreement", Advances in Computing Research, Vol. 5, pp. 443-497, 1989.

[10]

P. Feldman, "Asynchronous Byzantine Agreement in Constant Expected Time", unpublished manuscript, 1989.

[11]

P. Feldman, and S. Micah, "An Optimal Algorithm For Synchronous Byzantine Agreement", 20th STOC, pp. 148-161, 1988.

Digital Library

[12]

M. Fischer, "The Concensus Problem in Unreliable Distributed System", Technical Report, Yale University, 1983.

[13]

M. Fischer, N. Lynch and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", JACM, Vol. 32, no. 2, pp. 374-382, 1985.

Digital Library

[14]

A. Karlin and A. Yao, "Probabilistic Lower Bounds for Byzantine Agreement", unpublished manuscript, 1986.

[15]

M. Pease, R. Shostak and L. Lamport, "Reaching Agreement in the Presence of Faults", JACM, Vol. 27 No. 2, pp. 228-234, 1980.

Digital Library

[16]

M. Rabin, "Randomized Byzantine Generals", 24th FOCS, pp. 403-409, 1983.

[17]

T. Rabin, "Robust Sharing Of Secrets When The Dealer Is Honest Or Faulty", Masters Thesis, Hebrew University, submitted for publication to the JA CM.

[18]

T. Rabin and M. Ben-Or, "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority", 21st STOC, pp. 73-85, 1989.

Digital Library

[19]

A. Shamir, "How to share a secret", CA CM, Vol. 22, No. 11, pp. 612-613, 1979.

Digital Library

Cited By

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
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
Show More Cited By

Index Terms

Fast asynchronous Byzantine agreement with optimal resilience
1. Networks
  1. Network properties
    1. Network structure
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Asymptotically Optimal Validated Asynchronous Byzantine Agreement
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

We provide a new protocol for Validated Asynchronous Byzantine Agreement in the authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine ...
Optimal resilience asynchronous approximate agreement
OPODIS'04: Proceedings of the 8th international conference on Principles of Distributed Systems

Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed ε>0, an approximate agreement algorithm must have all non-faulty processes decide on values that are at most ε from each other and are in the range ...
Revisiting Optimal Resilience of Fast Byzantine Consensus
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three message ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Copyright © 1993 ACM.

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]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

180
Total Citations
View Citations
2,271
Total Downloads

Downloads (Last 12 months)449
Downloads (Last 6 weeks)40

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

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
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
Xie TGai KZhu LWang SZhang Z(2024)RAC-Chain: An Asynchronous Consensus-based Cross-chain Approach to Scalable Blockchain for MetaverseACM Transactions on Multimedia Computing, Communications, and Applications10.1145/358601120:7(1-24)Online publication date: 27-Mar-2024
https://dl.acm.org/doi/10.1145/3586011
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
Alpos OCachin CTackmann BZanolini L(2024)Asymmetric distributed trustDistributed Computing10.1007/s00446-024-00469-137:3(247-277)Online publication date: 28-May-2024
https://doi.org/10.1007/s00446-024-00469-1
Liu QZhang XDuan SZhang H(2024)Enhancing Permissioned Blockchains with Controlled Data AuthorizationInformation Security and Privacy10.1007/978-981-97-5101-3_1(3-23)Online publication date: 15-Jul-2024
https://doi.org/10.1007/978-981-97-5101-3_1
Song YLong YXu XGu D(2024)FaBFT: Flexible Asynchronous BFT Protocol Using DAGInformation Security and Cryptology10.1007/978-981-97-0945-8_20(343-355)Online publication date: 25-Feb-2024
https://doi.org/10.1007/978-981-97-0945-8_20
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

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents