2026-09-23T12:43:22Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/116220 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Ren, Ling 2022-08 application/pdf en text Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms The student, Irene Isaac, accepted the attached license on 2022-07-12 at 19:46. The student, Irene Isaac, submitted this Thesis for approval on 2022-07-12 at 20:18. This Thesis was approved for publication on 2022-07-15 at 11:45. DSpace SAF Submission Ingestion Package generated from Vireo submission #18257 on 2022-11-15 at 18:20:46 Implementation and evaluation of fast authenticated byzantine consensus Isaac, Irene M. 2022-07-15 Consensus PBFT Good Case Latency 2RS-BFT Partial Synchrony 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. Thesis eng https://hdl.handle.net/2142/116220 Copyright 2022 Irene Isaac M.S. Thesis Computer Science University of Illinois at Urbana-Champaign Computer Science