The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
SBFT: A Scalable and Decentralized Trust Infrastructure
Open accessAbstract
SBFT is a state of the art Byzantine fault tolerant state machine replication system that addresses the challenges of scalability, decentralization and global geo-replication. SBFT is optimized for decentralization and is experimentally evaluated on a deployment of more than 200 active replicas withstanding a malicious adversary controlling f=64 replicas. Our experiments show how the different algorithmic ingredients of SBFT contribute to its performance and scalability. The results show that SBFT simultaneously provides almost 2x better throughput and about 1.5x better latency relative to a highly optimized system that implements the PBFT protocol. To achieve this performance improvement, SBFT uses a combination of four ingredients: using collectors and threshold signatures to reduce communication to linear, using an optimistic fast path, reducing client communication and utilizing redundant servers for the fast path. SBFT is the first system to implement a correct dual-mode view change protocol that allows to efficiently run either an optimistic fast path or a fallback slow path without incurring a view change to switch between modes.
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
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
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
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
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · cited 3×
“On top of this we implement an authenticated keyvalue store that uses a Merkle tree interface [61] for data authentication.”
BackgroundMethodInfluentialConsensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding
Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., & Ford, B. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.000-5 · Cited by 1,253
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051 · cited 1×
“There is a growing interest in replacing or combining the current Proof-of-Work mechanisms with Byzantine fault tolerant replication [18], [34], [41], [75], [80].”
BackgroundA One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
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
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
State Machine Replication for the Masses with BFT-SMART
Bessani, A., Sousa, J., & Alchieri, E. E. P. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.43 · Cited by 567
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
Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10228 · Cited by 499
Viewstamped replication: a general primary copy
Oki, B. M., & Liskov, B. H. (1988) · Proceedings of the seventh annual ACM Symposium on Principles of distributed computing - PODC '88 · doi:10.1145/62546.62549 · Cited by 380
Decentralization in Bitcoin and Ethereum Networks
Gencer, A. E., Basu, S., Eyal, I., van Renesse, R., & Sirer, E. G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-58387-6_24 · Cited by 374
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
A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform
Sousa, J., Bessani, A., & Vukolic, M. (2018) · 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2018.00018 · Cited by 349
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
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
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., & Ford, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06997 · Cited by 309
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
Scalable Bias-Resistant Distributed Randomness
Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., & Ford, B. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.45 · Cited by 290
Martin, J.-P., & Alvisi, L. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.35 · Cited by 280
RBFT: Redundant Byzantine Fault Tolerance
Aublin, P.-L., Mokhtar, S. B., & Quema, V. (2013) · 2013 IEEE 33rd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2013.53 · Cited by 279
Easy impossibility proofs for distributed consensus problems
Fischer, M. J., Lynch, N. A., & Merritt, M. (1986) · Distributed Computing · doi:10.1007/bf01843568 · Cited by 257
Attested append-only memory: making adversaries stick to their word
Chun, B.-G., Maniatis, P., Shenker, S., & Kubiatowicz, J. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294280 · Cited by 247
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
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
Syta, E., Tamas, I., Visher, D., Wolinsky, D. I., Jovanovic, P., Gasser, L., Gailly, N., Khoffi, I., & Ford, B. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.38 · Cited by 244
Hybrid Consensus: Efficient Consensus in the Permissionless Model
Pass, R., & Shi, E. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.disc.2017.39 · Cited by 234
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
Self-citationXFT: practical fault tolerance beyond crashes
Liu, S., Viotti, P., Cachin, C., Quéma, V., & Vukolić, M. (2016) · Graduate School and Research Center in Digital Science (EURECOM) · doi:10.5555/3026877.3026915 · Cited by 214
Aublin, P.-L., Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2015) · ACM Transactions on Computer Systems · doi:10.1145/2658994 · Cited by 204
Updating Key Size Estimations for Pairings
Barbulescu, R., & Duquesne, S. (2018) · Journal of Cryptology · doi:10.1007/s00145-018-9280-5 · Cited by 200
BEAT: Asynchronous BFT Made Practical
Duan, S., Reiter, M. K., & Zhang, H. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243812 · Cited by 198
Self-citationCheapBFT: resource-efficient byzantine fault tolerance
Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Mohammadi, S. V., Schröder-Preikschat, W., & Stengel, K. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168866 · Cited by 197
Martin, J.-P., & Alvisi, L. (2005) · 2005 International Conference on Dependable Systems and Networks (DSN'05) · doi:10.1109/dsn.2005.48 · Cited by 195
Prime: Byzantine Replication under Attack
Amir, Y., Coan, B., Kirsch, J., & Lane, J. (2011) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2010.70 · Cited by 192
Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing
Liu, J., Li, W., Karame, G. O., & Asokan, N. (2019) · IEEE Transactions on Computers · doi:10.1109/tc.2018.2860009 · Cited by 185
The Rampart toolkit for building high-integrity services
Reiter, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_7 · Cited by 174
Self-citationCachin, C., Kursawe, K., & Shoup, V. (2000) · Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing · doi:10.1145/343477.343531 · Cited by 170
Viewstamped Replication Revisited
Liskov, B. H., & Cowling, J. A. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 166
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
CONIKS: Bringing Key Transparency to End Users
Melara, M. S., Blankstein, A., Bonneau, J., Felten, E. W., & Freedman, M. J. (2014) · Cited by 166
TrInc: small trusted hardware for large distributed systems
Levin, D., Douceur, J. R., Lorch, J. R., & Moscibroda, T. (2009) · Cited by 163
Malkhi, D., & Reiter, M. K. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258650 · Cited by 160
Self-citationHybrids on Steroids: SGX-Based High Performance BFT
Behl, J., Distler, T., & Kapitza, R. (2017) · European Conference on Computer Systems · doi:10.1145/3064176.3064213 · Cited by 156
Using abstraction to improve fault tolerance
Castro, M., Rodrigues, R., & Liskov, B. H. (2005) · Workshop on Hot Topics in Operating Systems · doi:10.1109/hotos.2001.990057 · Cited by 150
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
Amir, Y., Danilov, C. B., Dolev, D., Kirsch, J., Lane, J. W., Nita-Rotaru, C., Olsen, J. I., & Zage, D. (2008) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2008.53 · Cited by 140
How to securely replicate services
Reiter, M. K., & Birman, K. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177745 · Cited by 133
Self-citationScaling Byzantine Fault-Tolerant Replication toWide Area Networks
Amir, Y., Danilov, C. B., Kirsch, J., Lane, J. W., Dolev, D., Nita-Rotaru, C., Olsen, J. I., & Zage, D. (2006) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2006.63 · Cited by 99
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Ramasamy, H. V., & Cachin, C. (2006) · Lecture notes in computer science · doi:10.1007/11795490_9 · Cited by 90
ALGORAND: The Efficient and Democratic Ledger.Preprint
Micali, S. M. (2016) · arXiv (Cornell University) · Cited by 88
SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains.Preprint
Golan-Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Benny Pinkas, B., Reiter, M. K., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2018) · arXiv (Cornell University) · Cited by 72
Self-citationSolidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.Preprint
Abraham, I., Malkhi, D., Nayak, K., Ren, L., & Spiegelman, A. (2016) · arXiv (Cornell University) · Cited by 67
Self-citationRevisiting Fast Practical Byzantine Fault TolerancePreprint
Abraham, I., Gueta, G. G., Malkhi, D., Alvisi, L., Kotla, R., & Martin, J.-P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.01367 · Cited by 57
Self-citationPorto, D. C. F., Leitao, J. C. A., Li, C., Clement, A., Kate, A., Junqueira, F., & Rodrigues, R. (2015) · European Conference on Computer Systems · doi:10.1145/2741948.2741979 · Cited by 36
Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and ZelmaPreprint
Abraham, I., Gueta, G., Malkhi, D., & Martin, J.-P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10022 · Cited by 35
Self-citationGuerraoui, R., & Vukolić, M. (2010) · Distributed Computing · doi:10.1007/s00446-010-0103-7 · Cited by 28
Troxy: Transparent Access to Byzantine Fault-Tolerant Systems
Li, B., Weichbrodt, N., Behl, J., Aublin, P.-L., Distler, T., & Kapitza, R. (2018) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2018.00019 · Cited by 25
Blockchain Consensus Protocols
Ouattara, H., Ahmat, D., Ouédraogo, F., Bissyandé, T. F., & Sié, O. (2018) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-319-98827-6_29 · Cited by 25
Cited by
A systematic review of blockchain scalability: Issues, solutions, analysis and future research
Sanka, A. I., & Cheung, R. C. C. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.103232 · Cited by 283
Blockchain Security: A Survey of Techniques and Research Directions
Leng, J., Zhou, M., Zhao, J. L., Huang, Y., & Bian, Y. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.3038641 · Cited by 279
Metadata
- Authors
- Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A.
- Venue
- 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
- Publisher
- IEEE
- Published
- 2019-06
- Pages
- 568-580
- OpenAlex
- W2907349043
- Cited by
- 362
- References
- 67
- FWCI
- 32.93
- Type
- conference paper
- Language
- en
- Open access
- green
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.