Implementation and evaluation of fast authenticated byzantine consensus

Isaac, Irene M.

Permalink

https://hdl.handle.net/2142/116220 Copy

Description

Title

Implementation and evaluation of fast authenticated byzantine consensus

Author(s)

Isaac, Irene M.

Issue Date

2022-07-15

Director of Research (if dissertation) or Advisor (if thesis)

Ren, Ling

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• Consensus
• PBFT
• Good Case Latency
• 2RS-BFT
• Partial Synchrony

Abstract

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for several decades. Improving the latency of BFT-SMR has gained interest in recent years. In this thesis, we focus on improving the good case latency of BFT-SMR in the partial synchrony model, when an honest leader is in charge and the network is synchronous. Practical Byzantine Fault Tolerance (PBFT) has a good case latency of 3 rounds and a resilience of n ≥ 3f + 1. 2 Round Signature-based BFT (2RS-BFT) is a recent protocol that has a good case latency of 2 rounds and a resilience of n ≥ 5f − 1. For the canonical case of n = 4 and f = 1, 2RS-BFT has the same resilience as PBFT and can commit in 2 rounds. In this thesis, we propose a chained version of PBFT. We implement the steady state of both chained PBFT and 2RS-BFT protocol and show that 2RS-BFT protocol is concretely better than PBFT in terms of good case latency. 2RS-BFT can commit in 62.5% - 63.4% of the time required by PBFT to commit.

Graduation Semester

2022-08

Type of Resource

Thesis

Copyright and License Information

Copyright 2022 Irene Isaac

Owning Collections