The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Byzantine quorum systems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
A Majority consensus approach to concurrency control for multiple copy databases
Thomas, R. H. (1979) · ACM Transactions on Database Systems · doi:10.1145/320071.320076 · Cited by 1,003
How to assign votes in a distributed system
Garcia-Molina, H., & Barbara, D. (1985) · Journal of the ACM · doi:10.1145/4221.4223 · Cited by 563
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
An efficient and fault-tolerant solution for distributed mutual exclusion
Agrawal, D., & Abbadi, A. E. (1991) · ACM Transactions on Computer Systems · doi:10.1145/103727.103728 · Cited by 294
A quorum-consensus replication method for abstract data types
Herlihy, M. P. (1986) · ACM Transactions on Computer Systems · doi:10.1145/6306.6308 · Cited by 247
Malkhi, D., & Reiter, M. K. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258650 · Cited by 160
Self-citation
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
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
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
A Survey on Security and Privacy Issues of Bitcoin
Conti, M., Sandeep Kumar, E., Lal, C., & Ruj, S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2842460 · Cited by 1,116
“Despite the use of strict ordering of transactions in the blockchain, PoW scheme, distributed time-stamping [91], and consensus protocol [92], [93], double spending is still possible in Bitcoin.”
Method
Metadata
- Authors
- Malkhi, D., & Reiter, M.
- Venue
- Distributed Computing
- Published
- 1998-10-01
- Volume
- 11
- Issue
- 4
- Pages
- 203-213
- ISSN
- 0178-2770 (ISSN-L)
- OpenAlex
- W2080288192
- Cited by
- 530
- References
- 14
- FWCI
- 12.31
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Byzantine quorum systems. https://app.cochat.ai/papers/10.1007/s004460050050
- The paper
- Malkhi, D., & Reiter, M. (1998). Byzantine quorum systems. Distributed Computing. https://doi.org/10.1007/s004460050050
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.