A New Way to Achieve Round-Efficient Byzantine Agreement
Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss
Abstract
Minimizing the round complexity of Byzantine Agreement (BA) protocols is a fundamental problem in distributed computing. The typical approach to achieve round efficient (randomized) BA is to have a weak form of BA, called graded consensus (GC), followed by a distributed coin, and to repeat this process until some termination condition is met---as introduced by Feldman and Micali (STOC'88).
Topics & Concepts
Computer scienceByzantine architectureByzantine fault toleranceDistributed computingProcess (computing)Theoretical computer scienceFault toleranceOperating systemHistoryAncient historyDistributed systems and fault toleranceCryptography and Data SecurityLogic, Reasoning, and Knowledge