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 条
  • [61] Ramasamy HV, 2006, LECT NOTES COMPUT SC, V3974, P88
  • [62] HOW TO SECURELY REPLICATE SERVICES
    REITER, MK
    BIRMAN, KP
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 986 - 1009
  • [63] Reiter MK, 1995, LECT NOTES COMPUT SC, V938, P99
  • [64] Shoup V, 2000, LECT NOTES COMPUT SC, V1807, P207
  • [65] A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform
    Sousa, Joao
    Bessani, Alysson
    Vukolic, Marko
    [J]. 2018 48TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2018, : 51 - 58
  • [66] Sousa Joao, 2017, ABS170906921 CORR
  • [67] Scalable Bias-Resistant Distributed Randomness
    Syta, Ewa
    Jovanovic, Philipp
    Kogias, Eleftherios Kokoris
    Gailly, Nicolas
    Gasser, Linus
    Khoffi, Ismail
    Fischer, Michael J.
    Ford, Bryan
    [J]. 2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, : 444 - 460
  • [68] Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
    Syta, Ewa
    Tamas, Iulia
    Visher, Dylan
    Wolinsky, David Isaac
    Jovanovic, Philipp
    Gasser, Linus
    Gailly, Nicolas
    Khoffi, Ismail
    Ford, Bryan
    [J]. 2016 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2016, : 526 - 545
  • [69] Szabo Nick, 2001, TRUSTED 3 PARTIES AR
  • [70] Efficient Byzantine Fault-Tolerance
    Veronese, Giuliana Santos
    Correia, Miguel
    Bessani, Alysson Neves
    Lung, Lau Cheuk
    Verissimo, Paulo
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (01) : 16 - 30