000165021 001__ 165021
000165021 005__ 20190316235100.0
000165021 037__ $$aREP_WORK
000165021 245__ $$aOn the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
000165021 269__ $$a2011
000165021 260__ $$c2011
000165021 336__ $$aReports
000165021 520__ $$aWe investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we give the first atomic broadcast reduction algorithm with a constant time complexity with respect to consensus.
000165021 6531_ $$aAtomic broadcast; Consensus; Byzantine faults; Reduction
000165021 700__ $$0243466$$aMilosevic, Zarko$$g173713
000165021 700__ $$0243462$$aHutle, Martin$$g172802
000165021 700__ $$0241767$$aSchiper, André$$g106377
000165021 8564_ $$s337169$$uhttps://infoscience.epfl.ch/record/165021/files/paper.pdf$$yn/a$$zn/a
000165021 909C0 $$0252206$$pLSR$$xU10411
000165021 909CO $$ooai:infoscience.tind.io:165021$$pIC$$preport$$qGLOBAL_SET
000165021 917Z8 $$x173713
000165021 917Z8 $$x173713
000165021 917Z8 $$x173713
000165021 917Z8 $$x173713
000165021 917Z8 $$x173713
000165021 937__ $$aEPFL-REPORT-165021
000165021 973__ $$aEPFL$$sPUBLISHED
000165021 980__ $$aREPORT