SBFT: a Scalable and Decentralized Trust Infrastructure

被引:201
作者
Gueta, Guy Golan [1 ]
Abraham, Ittai [1 ]
Grossman, Shelly [2 ]
Malkhi, Dahlia [1 ]
Pinkas, Benny [3 ]
Reiter, Michael [4 ]
Seredinschi, Dragos-Adrian [5 ]
Tamir, Orr [2 ]
Tomescu, Alin [6 ]
机构
[1] VMware Res, Palo Alto, CA 94304 USA
[2] Tel Aviv Univ, Tel Aviv, Israel
[3] BIU, Ramat Gan, Israel
[4] Univ N Carolina, Chapel Hill, NC USA
[5] Ecole Polytech Fed Lausanne, Lausanne, Switzerland
[6] MIT, Cambridge, MA 02139 USA
来源
2019 49TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN 2019) | 2019年
关键词
DISTRIBUTED CONSENSUS; IMPOSSIBILITY;
D O I
10.1109/DSN.2019.00063
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:568 / 580
页数:13
相关论文
共 72 条
  • [11] The Next 700 BFT Protocols
    Aublin, Pierre-Louis
    Guerraoui, Rachid
    Knezevic, Nikola
    Quema, Vivien
    Vukolic, Marko
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2015, 32 (04):
  • [12] Aublin Pierre-Louis, 2013, 33 INT C DISTR COMP
  • [13] Hybrids on Steroids: SGX-Based High Performance BFT
    Behl, Johannes
    Distler, Tobias
    Kapitza, Rudiger
    [J]. PROCEEDINGS OF THE TWELFTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS 2017), 2017, : 222 - 237
  • [14] State Machine Replication for the Masses with BFT-SMART
    Bessani, Alysson
    Sousa, Joao
    Alchieri, Eduardo E. P.
    [J]. 2014 44TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2014, : 355 - 362
  • [15] Beuchat Jean-Luc, 2010, HIGH SPEED SOFTWARE, P21
  • [16] Boldyreva A., 2002, Public Key Cryptography - PKC 2003. 6th International Workshop on Practice and Theory in Public Key Cryptography. Proceedings (Lecture Notes in Computer Science Vol.2567), P31
  • [17] Short signatures from the Weil pairing
    Boneh, D
    Lynn, B
    Shacham, H
    [J]. JOURNAL OF CRYPTOLOGY, 2004, 17 (04) : 297 - 319
  • [18] ARGO upper salinity measurements: Perspectives for L-band radiometers calibration and retrieved sea surface salinity validation
    Boutin, J
    Martin, N
    [J]. IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2006, 3 (02) : 202 - 206
  • [19] Buterin V, 2017, Minimal slashing conditions
  • [20] Byung-Gon Chun, 2007, Operating Systems Review, V41, P189, DOI 10.1145/1323293.1294280