Reaching Agreement in the Presence of Faults
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor. It is shown that the problem is solvable for, and only for, n ≥ 3 m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
Self-citation
Cited by
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
“(3) For each i: When Lieutenant i will receive no more messages, he obeys the order choice( Vi).”
BackgroundMethodInfluentialSelf-citationOn the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
A Secure Sharding Protocol For Open Blockchains
Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., & Saxena, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978389 · Cited by 1,428
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
RapidChain: Scaling Blockchain via Full Sharding
Zamani, M., Movahedi, M., & Raykova, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243853 · Cited by 1,121
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
The Byzantine generals problem
International, S., Lamport, L., Shostak, R., International, S., Pease, M., & International, S. (2019) · Concurrency: the Works of Leslie Lamport · doi:10.1145/3335772.3335936 · Cited by 1,033
Self-citationHotStuff: BFT Consensus with Linearity and Responsiveness
Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331591 · Cited by 1,028
A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
Wang, W., Hoang, D. T., Hu, P., Xiong, Z., Niyato, D., Wang, P., Wen, Y., & Kim, D. I. (2019) · IEEE Access · doi:10.1109/access.2019.2896108 · Cited by 995
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
Zyzzyva: speculative byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294267 · Cited by 638
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
Li, L., Liu, J., Cheng, L., Qiu, S., Wang, W., Zhang, X., & Zhang, Z. (2018) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2777990 · Cited by 571
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
Biais, B., Bisière, C., Bouvard, M., & Casamatta, C. (2019) · The Review of Financial Studies · doi:10.1093/rfs/hhy095 · Cited by 565
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657005 · Cited by 563
Synchronizing clocks in the presence of faults
Lamport, L., & Melliar-Smith, P. M. (1985) · Journal of the ACM · doi:10.1145/2455.2457 · Cited by 543
Self-citationReaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
A lower bound for the time to assure interactive consistency
Fischer, M. J., & Lynch, N. A. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90033-3 · Cited by 519
Asynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
A Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
Owre, S., Rushby, J., Shankar, N., & von Henke, F. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.345827 · Cited by 493
A survey of blockchain consensus algorithms performance evaluation criteria
Bamakan, S. M. H., Motavali, A., & Babaei Bondarti, A. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113385 · Cited by 481
On the security of public key protocols
Dolev, D., & Yao, A. C. (1981) · 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) · doi:10.1109/sfcs.1981.32 · Cited by 478
Mamoshina, P., Ojomoko, L., Yanovich, Y., Ostrovski, A., Botezatu, A., Prikhodko, P., Izumchenko, E., Aliper, A., Romantsov, K., Zhebrak, A., et al. (2018) · Oncotarget · doi:10.18632/oncotarget.22345 · Cited by 471
“To order transactions in the transaction log and agree on the result of transaction execution, Exonum utilizes an authenticated, leader-based Byzantine fault-tolerant (BFT) [73] consensus algorithm.”
MethodHow to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
Supply Chain Finance Innovation Using Blockchain
Du, M., Chen, Q., Xiao, J., Yang, H., & Ma, X. (2020) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2020.2971858 · Cited by 418
(2003) · IEEE Control Systems · doi:10.1109/mcs.2003.1213600 · Cited by 407
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 400
Secure and Efficient Asynchronous Broadcast Protocols
Cachin, C., Kursawe, K., Petzold, F., & Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_31 · Cited by 371
The consensus problem in unreliable distributed systems (a brief survey)
Fischer, M. J. (1983) · Lecture Notes in Computer Science · doi:10.1007/3-540-12689-9_99 · Cited by 367
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
Cristian, F., Aghili, H., Strong, R., & Volev, D. (2005) · Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. · doi:10.1109/ftcsh.1995.532668 · Cited by 353
Consensus on transaction commit
Gray, J., & Lamport, L. (2006) · ACM Transactions on Database Systems · doi:10.1145/1132863.1132867 · Cited by 346
Self-citationPeerReview: practical accountability for distributed systems
Haeberlen, A., Kouznetsov, P., & Druschel, P. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294279 · Cited by 337
Efficient Byzantine Fault-Tolerance
Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.221 · Cited by 337
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
Self-citationEnhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., & Ford, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06997 · Cited by 309
Fast asynchronous Byzantine agreement with optimal resilience
Canetti, R., & Rabin, T. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167105 · Cited by 309
Computing with Noisy Information
Feige, U., Raghavan, P., Peleg, D., & Upfal, E. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539791195877 · Cited by 304
Zyzzyva: Speculative Byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2009) · ACM Transactions on Computer Systems · doi:10.1145/1658357.1658358 · Cited by 292
Can Blockchains Serve an Accounting Purpose?
Coyne, J. G., & McMickle, P. L. (2017) · Journal of Emerging Technologies in Accounting · doi:10.2308/jeta-51910 · Cited by 291
Cloud Computing Security: From Single to Multi-clouds
AlZain, M. A., Pardede, E., Soh, B., & Thom, J. A. (2012) · 2012 45th Hawaii International Conference on System Sciences · doi:10.1109/hicss.2012.153 · Cited by 285
Algorand: A secure and efficient distributed ledger
Chen, J., & Micali, S. (2019) · Theoretical Computer Science · doi:10.1016/j.tcs.2019.02.001 · Cited by 281
Wang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
Survey: sharding in blockchains
Yu, G., Wang, X., Yu, K., Ni, W., Zhang, J. A., & Liu, R. P. (2020) · IEEE Access · doi:10.1109/access.2020.2965147 · Cited by 267
“After that, members in the final committee agree on a single set of hash values S [68], with numbers of Hash(λi) ranging from [2m/3, 3m/2] (m denotes the size of the final committee)3.”
BackgroundSmart contracts on the blockchain – A bibliometric analysis and review
Ante, L. (2021) · Telematics and Informatics · doi:10.1016/j.tele.2020.101519 · Cited by 267
Byzantine generals in action: implementing fail-stop processors
Schneider, F. B. (1984) · ACM Transactions on Computer Systems · doi:10.1145/190.357399 · Cited by 266
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Performance analysis and comparison of PoW, PoS and DAG based blockchains
Cao, B., Zhang, Z., Feng, D., Zhang, S., Zhang, L., Peng, M., & Li, Y. (2020) · Digital Communications and Networks · doi:10.1016/j.dcan.2019.12.001 · Cited by 263
Easy impossibility proofs for distributed consensus problems
Fischer, M. J., Lynch, N. A., & Merritt, M. (1986) · Distributed Computing · doi:10.1007/bf01843568 · Cited by 257
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62225 · Cited by 255
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
An Equilibrium Valuation of Bitcoin and Decentralized Network Assets
Pagnotta, E., & Buraschi, A. (2018) · doi:10.2139/ssrn.3142022 · Cited by 199
Byzantine Fault-Tolerant Consensus Algorithms: A Survey
Zhong, W., Yang, C., Liang, W., Cai, J., Chen, L., Liao, J., & Xiong, N. (2023) · Electronics · doi:10.3390/electronics12183801 · Cited by 90
Metadata
- Authors
- Pease, M., Shostak, R., & Lamport, L.
- Venue
- Journal of the ACM
- Published
- 1980-04
- Volume
- 27
- Issue
- 2
- Pages
- 228-234
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2126924915
- Cited by
- 2,359
- References
- 4
- FWCI
- 22.07
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.