The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Efficient Byzantine Fault-Tolerance
Abstract
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f+1 replicas, instead of the usual 3f+1. Second, the trusted service in which this reduction of replicas is based is quite simple, making a verified implementation straightforward (and even feasible using commercial trusted hardware). Third, in nice executions the two algorithms run in the minimum number of communication steps for nonspeculative and speculative algorithms, respectively, four and three steps. Besides the obvious benefits in terms of cost, resilience and management complexity-fewer replicas to tolerate a certain number of faults-our algorithms are simpler than previous ones, being closer to crash fault-tolerant replication algorithms. The performance evaluation shows that, even with the trusted component access overhead, they can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays.
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
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
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
Cited by
Towards Scalable and Private Industrial Blockchains
Li, W., Sforzin, A., Fedorov, S., & Karame, G. O. (2017) · Proceedings of the ACM Workshop on Blockchain, Cryptocurrencies and Contracts · doi:10.1145/3055518.3055531 · Cited by 133
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
Secure distributed estimation under Byzantine attack and manipulation attack
Wan, F., Ma, T., Hua, Y., Liao, B., & Qing, X. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105384 · Cited by 19
Metadata
- Authors
- Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P.
- Venue
- IEEE Transactions on Computers
- Published
- 2013-01
- Volume
- 62
- Issue
- 1
- Pages
- 16-30
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2151426692
- Cited by
- 337
- References
- 2
- FWCI
- 12.23
- 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: Efficient Byzantine Fault-Tolerance. https://app.cochat.ai/papers/10.1109/tc.2011.221
- The paper
- Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P. (2013). Efficient Byzantine Fault-Tolerance. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2011.221
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.
