The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
RBFT: Redundant Byzantine Fault Tolerance
Abstract
Byzantine Fault Tolerant state machine replication (BFT) protocols are replication protocols that tolerate arbitrary faults of a fraction of the replicas. Although significant efforts have been recently made, existing BFT protocols do not provide acceptable performance when faults occur. As we show in this paper, this comes from the fact that all existing BFT protocols targeting high throughput use a special replica, called the primary, which indicates to other replicas the order in which requests should be processed. This primary can be smartly malicious and degrade the performance of the system without being detected by correct replicas. In this paper, we propose a new approach, called RBFT for Redundant-BFT: we execute multiple instances of the same BFT protocol, each with a primary replica executing on a different machine. All the instances order the requests, but only the requests ordered by one of the instances, called the master instance, are actually executed. The performance of the different instances is closely monitored, in order to check that the master instance provides adequate performance. If that is not the case, the primary replica of the master instance is considered malicious and replaced. We implemented RBFT and compared its performance to that of other existing robust protocols. Our evaluation shows that RBFT achieves similar performance as the most robust protocols when there is no failure and that, under faults, its maximum performance degradation is about 3%, whereas it is at least equal to 78% for existing protocols.
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
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
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · USENIX Annual Technical Conference · Cited by 1,968
Making Byzantine fault tolerant systems tolerate Byzantine faults
Clement, A., Wong, E. L., Alvisi, L., Dahlin, M., & Marchetti, M. (2009) · Networked Systems Design and Implementation · Cited by 522
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
Cowling, J. A., Myers, D. S., Liskov, B. H., Rodrigues, R., & Shrira, L. (2006) · doi:10.5555/1298455.1298473 · Cited by 297
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
Clement, A., Kapritsos, M., Lee, S., Wang, Y., Alvisi, L., Dahlin, M., & Riche, T. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629602 · Cited by 247
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095817 · Cited by 220
Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755950 · Cited by 219
Cited by
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
A first look at identity management schemes on the blockchain
Dunphy, P., & Petitcolas, F. A. P. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3111247 · Cited by 416
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
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
Huo, R., Zeng, S., Wang, Z., Shang, J., Chen, W., Huang, T., Wang, S., Yu, F. R., & Liu, Y. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3141490 · Cited by 268
Analysis of identity management systems using blockchain technology
Haddouti, S. E., & Ech-Cherif El Kettani, M. D. (2019) · 2019 International Conference on Advanced Communication Technologies and Networking (CommNet) · doi:10.1109/commnet.2019.8742375 · Cited by 106
Blockchain-based distributed software-defined vehicular networks: a dueling deep q-learning approach
Zhang, D., Yu, F. R., & Yang, R. (2019) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2019.2944399 · Cited by 96
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
A New Approach to Client Onboarding Using Self-Sovereign Identity and Distributed Ledger
Soltani, R., Trang Nguyen, U., & An, A. (2018) · 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00205 · Cited by 77
Zhang, D., Yu, F. R., & Yang, R. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3110591 · Cited by 45
A blockchain empowered and privacy preserving digital contact tracing platform
Bandara, E., Liang, X., Foytik, P., Shetty, S., Hall, C., Bowden, D., Ranasinghe, N., & De Zoysa, K. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102572 · Cited by 39
A Comparative Survey on Blockchain Based Self Sovereign Identity System
Kaneriya, J., & Patel, H. (2020) · 2020 3rd International Conference on Intelligent Sustainable Systems (ICISS) · doi:10.1109/iciss49785.2020.9315899 · Cited by 31
Methods for Decentralized Identities: Evaluation and Insights
Fdhila, W., Stifter, N., Kostal, K., Saglam, C., & Sabadello, M. (2021) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-030-85867-4_9 · Cited by 28
Qualified eID Derivation Into a Distributed Ledger Based IdM System
Abraham, A., Theuermann, K., & Kirchengast, E. (2018) · 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE) · doi:10.1109/trustcom/bigdatase.2018.00195 · Cited by 18
Metadata
- Authors
- Aublin, P.-L., Mokhtar, S. B., & Quema, V.
- Venue
- 2013 IEEE 33rd International Conference on Distributed Computing Systems
- Publisher
- IEEE
- Published
- 2013-07
- Pages
- 297-306
- OpenAlex
- W2013608896
- Cited by
- 279
- References
- 18
- FWCI
- 4.87
- 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.