The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Randomized byzantine generals
Abstract
We present a randomized solution for the Byzantine Generals Problems. The solution works in the synchronous as well as the asynchronous case and produces Byzantine Agreement within a fixed small expected number of computational rounds, independent of the number n of processes and the bound t on the number of faulty processes. The solution uses A. Shamir's method for sharing secrets. It specializes to produce a simple solution for the Distributed Commit problem.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
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
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
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
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
Cited by
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
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
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
“We will refer to several well-known primitive building blocks for constructing distributed protocols: Byzantine Agreement [20], Distributed Coin Flipping [22], Verifiable Secret Sharing (VSS) [8], Non-Malleable VSS, and Secure Function Evaluation (SFE) [18].”
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
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
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
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
Resilient Asymptotic Consensus in Robust Networks
LeBlanc, H. J., Zhang, H., Koutsoukos, X., & Sundaram, S. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130413 · Cited by 730
Automatic verification of probabilistic concurrent finite state programs
Vardi, M. Y. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.12 · Cited by 680
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
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
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Total order broadcast and multicast algorithms: Taxonomy and survey
Défago, X., Schiper, A., & Urbán, P. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041682 · Cited by 543
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
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
How to share a secret with cheaters
Tompa, M., & Woll, H. (1989) · Journal of Cryptology · doi:10.1007/bf02252871 · Cited by 388
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
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_12 · Cited by 359
From blockchain consensus back to byzantine consensus
Gramoli, V. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2017.09.023 · Cited by 314
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Houser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., & Terry, D. (1988) · ACM SIGOPS Operating Systems Review · doi:10.1145/43921.43922 · Cited by 312
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
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
Dumbo: Faster Asynchronous BFT Protocols
Guo, B., Lu, Z., Tang, Q., Xu, J., & Zhang, Z. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417262 · Cited by 278
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
Mao, Y., Kang, Y., Li, P., Zhang, N., Xu, W., & Zhang, C. (2024) · arXiv · doi:10.48550/arxiv.2410.16237
Metadata
- Authors
- Rabin, M. O.
- Venue
- 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- Publisher
- IEEE
- Published
- 1983-11
- Pages
- 403-409
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1991153938
- Cited by
- 589
- References
- 8
- FWCI
- 10.36
- Type
- conference paper
- Language
- en
- Open access
- closed
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.