000140295 001__ 140295
000140295 005__ 20190316234607.0
000140295 037__ $$aREP_WORK
000140295 245__ $$aUnifying Byzantine Consensus Algorithms with Weak Interactive Consistency
000140295 269__ $$a2009
000140295 260__ $$c2009
000140295 336__ $$aReports
000140295 520__ $$aThe paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes (1) authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption that the signature cannot be forged by any other process), and (2) Byzantine faults, where there is no mechanism for signatures (but the receiver of a message knows the identity of the sender). The paper proposes an abstraction called weak interactive consistency (WIC) that unifies consensus algorithms with and without signed messages. WIC can be implemented with and without signatures. The power of WIC is illustrated on two seminal Byzantine consensus algorithms: the Castro-Liskov PBFT algorithm (no signatures) and the Martin-Alvisi FaB Paxos algorithms (signatures). WIC allows a very concise expression of these two algorithms. Moreover, using a implementation of WIC without signatures allows us to derive a signature-free variant of FaB Paxos.
000140295 700__ $$0243466$$aMilosevic, Zarko$$g173713
000140295 700__ $$0243462$$aHutle, Martin$$g172802
000140295 700__ $$0241767$$aSchiper, André$$g106377
000140295 8564_ $$zURL
000140295 8564_ $$s246156$$uhttps://infoscience.epfl.ch/record/140295/files/paper-tr.pdf$$zn/a
000140295 909C0 $$0252206$$pLSR$$xU10411
000140295 909CO $$ooai:infoscience.tind.io:140295$$pIC$$preport$$qGLOBAL_SET
000140295 937__ $$aLSR-REPORT-2009-003
000140295 973__ $$aEPFL$$sPUBLISHED
000140295 980__ $$aREPORT