000133557 001__ 133557
000133557 005__ 20190316234456.0
000133557 037__ $$aREP_WORK
000133557 245__ $$aA Leader-free Byzantine Consensus Algorithm
000133557 269__ $$a2009
000133557 260__ $$c2009
000133557 336__ $$aReports
000133557 520__ $$aThe paper considers the consensus problem in a partially synchronous system with Byzantine faults. All deterministic algorithms that solve consensus in this context are leader-based. However, in the context of Byzantine faults, leader-based algorithms are more vulnerable to performance degradation than leader-free (non-leader-based) algorithms. This is because a Byzantine leader can cause the system to make progress at an extremely slow rate. This raises the following fundamental question: is it possible to design a deterministic Byzantine consensus algorithm for a partially synchronous system that is not leader-based? The paper gives a positive answer to this question, and presents an algorithm that is resilient-optimal and signature-free.
000133557 6531_ $$aDistributed algorithms
000133557 6531_ $$aFault tolerance
000133557 6531_ $$aByzantine consensus
000133557 6531_ $$aPartial synchrony
000133557 6531_ $$aLeader-free algorithms
000133557 700__ $$0243463$$aBorran, Fatemeh$$g149659
000133557 700__ $$0241767$$aSchiper, André$$g106377
000133557 8564_ $$zURL
000133557 8564_ $$s242846$$uhttps://infoscience.epfl.ch/record/133557/files/LeaderFreeTR.pdf$$zn/a
000133557 909C0 $$0252206$$pLSR$$xU10411
000133557 909CO $$ooai:infoscience.tind.io:133557$$pIC$$preport$$qGLOBAL_SET
000133557 917Z8 $$x149659
000133557 917Z8 $$x149659
000133557 937__ $$aLSR-REPORT-2009-001
000133557 973__ $$aEPFL$$sPUBLISHED
000133557 980__ $$aREPORT