article

Open access

The Byzantine Generals Problem

Editor: Susan L. Graham Authors:

Leslie Lamport,

Robert Shostak,

Marshall PeaseAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 4, Issue 3

Pages 382 - 401

https://doi.org/10.1145/357172.357176

Published: 01 July 1982 Publication History

PDF eReader

References

[1]

DIFFIE, W., AND HELLMAN, M.E. New directions in cryptography. IEEE Trans. Inf. Theory IT-22 (Nov. 1976), 644-654.

Google Scholar

[2]

DOLEV, D. The Byzantine generals strike again. J. Algorithms 3, I (Jan. 1982).

Google Scholar

[3]

PEASE, M., SHOSTAK, R., AND LAMPORT, L. Reaching agreement in the presence of faults. J. ACM 27, 2 (Apr. 1980), 228-234.

Crossref

Google Scholar

[4]

RIVEST, R.L., SHAMIR, A., AND ADLEMAN, L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120-126.

Crossref

Google Scholar

Cited By

View all

Kshemkalyani AMisra A(2025)Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation ProblemsAlgorithms10.3390/a1801002618:1(26)Online publication date: 5-Jan-2025
https://doi.org/10.3390/a18010026
Chen XLi X(2025)TinyThunder: enabling asynchronous Byzantine fault tolerance with optimal communication efficiencyThe Computer Journal10.1093/comjnl/bxae120Online publication date: 8-Jan-2025
https://doi.org/10.1093/comjnl/bxae120
Hao RDing CDai XFan HXiang J(2025)High-performance BFT consensus for Metaverse through block linking and shortcut loopComputer Communications10.1016/j.comcom.2024.107990229(107990)Online publication date: Jan-2025
https://doi.org/10.1016/j.comcom.2024.107990
Show More Cited By

Index Terms

The Byzantine Generals Problem

Recommendations

Authenticated Byzantine generals in dual failure model
ICDCN'10: Proceedings of the 11th international conference on Distributed computing and networking

Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BGP among n players tolerating up to t faults is (efficiently) possible iff n ...
Application-Aware Byzantine Fault Tolerance
DASC '14: Proceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

Byzantine fault tolerance has been intensively studied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 4, Issue 3

July 1982

199 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/357172

Editor:
Susan L. Graham

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1982

Published in TOPLAS Volume 4, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4,336
Total Citations
View Citations
29,762
Total Downloads

Downloads (Last 12 months)3,082
Downloads (Last 6 weeks)398

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kshemkalyani AMisra A(2025)Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation ProblemsAlgorithms10.3390/a1801002618:1(26)Online publication date: 5-Jan-2025
https://doi.org/10.3390/a18010026
Chen XLi X(2025)TinyThunder: enabling asynchronous Byzantine fault tolerance with optimal communication efficiencyThe Computer Journal10.1093/comjnl/bxae120Online publication date: 8-Jan-2025
https://doi.org/10.1093/comjnl/bxae120
Hao RDing CDai XFan HXiang J(2025)High-performance BFT consensus for Metaverse through block linking and shortcut loopComputer Communications10.1016/j.comcom.2024.107990229(107990)Online publication date: Jan-2025
https://doi.org/10.1016/j.comcom.2024.107990
Blum EBoyle ECohen RLiu-Zhang C(2025)Communication lower bounds for cryptographic broadcast protocolsDistributed Computing10.1007/s00446-024-00473-5Online publication date: 7-Jan-2025
https://doi.org/10.1007/s00446-024-00473-5
Guo HLiu K(2024)The Chasm of Technology Innovation in Digital Transformation: A Study from the Perspective of Transformation InformaticsInnovation - Research and Development for Human, Economic and Institutional Growth10.5772/intechopen.111793Online publication date: 13-Mar-2024
https://doi.org/10.5772/intechopen.111793
Qian CWang MRen HZou CSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)ByMIProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693751(41357-41382)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3693751
Park CLee NSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)SignSGD with federated defenseProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693680(39762-39780)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3693680
Allouah YFarhadkhani SGuerraoui RGupta NPinot RRizk GVoitovych SSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Byzantine-robust federated learningProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692116(1078-1114)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692116
Antunes DOliveira ABreda AFranco MMoniz HRodrigues RVanbever LZhang I(2024)Alea-BFTProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691844(313-328)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691844
Reynouard MGorelkina OLaraki RDastani MSichman JAlechina NDignum V(2024)BAR Nash Equilibrium and Application to Blockchain DesignProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663185(2435-2437)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663185
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Authenticated Byzantine generals in dual failure model

Application-Aware Byzantine Fault Tolerance

Multi-Threshold Byzantine Fault Tolerance

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations