The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Fast Byzantine Consensus
Abstract
We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps and number of processes for two-step consensus. The protocol can be used to build a replicated state machine that requires only three communication steps per request in the common case. Further, we show a parameterized version of the protocol that is safe despite f Byzantine failures and, in the common case, guarantees two-step execution despite some number t of failures (t les f). We show that this parameterized two-step consensus protocol is also optimal in terms of both number of communication steps and number of processes
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
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
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
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
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
Lamport, L. (2006) · Distributed Computing · doi:10.1007/s00446-006-0005-x · Cited by 474
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
Self-citationEarly consensus in an asynchronous system with a weak failure detector
Schiper, A. (1997) · Distributed Computing · doi:10.1007/s004460050032 · Cited by 188
BASE: using abstraction to improve fault tolerance
Rodrigues, R., Castro, M., & Liskov, B. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502037 · Cited by 166
Martin, J.-P., Alvisi, L., & Dahlin, M. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36108-1_21 · Cited by 160
Self-citationBoichat, R., Dutta, P., Frølund, S., & Guerraoui, R. (2003) · ACM SIGACT News · doi:10.1145/637437.637447 · Cited by 143
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/945445.945470 · Cited by 142
Self-citationLower Bounds for Asynchronous Consensus
Lamport, L. (2003) · Lecture notes in computer science · doi:10.1007/3-540-37795-6_4 · Cited by 90
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
Friedman, R., Mostéfaoui, A., & Raynal, M. (2005) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2005.13 · Cited by 75
Cited by
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
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
Self-citationA Comprehensive Review of Blockchain Consensus Mechanisms
Lashkari, B., & Musilek, P. (2021) · IEEE Access · doi:10.1109/access.2021.3065880 · Cited by 499
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
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
Metadata
- Authors
- Martin, J.-P., & Alvisi, L.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2006-07
- Volume
- 3
- Issue
- 3
- Pages
- 202-215
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2058322902
- Cited by
- 280
- References
- 15
- FWCI
- 16.66
- 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
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.