000178636 001__ 178636
000178636 005__ 20190316235421.0
000178636 0247_ $$2doi$$a10.1109/SRDS.2011.36
000178636 020__ $$a978-0-7695-4450-2
000178636 02470 $$2ISI$$a000298004600027
000178636 037__ $$aCONF
000178636 245__ $$aOn the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
000178636 269__ $$a2011
000178636 260__ $$bIeee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa$$c2011
000178636 336__ $$aConference Papers
000178636 490__ $$aSymposium on Reliable Distributed Systems Proceedings
000178636 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 deterministic atomic broadcast reduction with a constant time complexity with respect to consensus.
000178636 6531_ $$aAtomic broadcast
000178636 6531_ $$aConsensus
000178636 6531_ $$aByzantine faults
000178636 6531_ $$aReduction
000178636 700__ $$0243466$$g173713$$aMilosevic, Zarko
000178636 700__ $$0243462$$g172802$$aHutle, Martin
000178636 700__ $$aSchiper, Andre$$g106377$$0241767
000178636 7112_ $$dOct 04-07, 2011$$cMadrid, SPAIN$$a30th IEEE International Symposium on Reliable Distributed Systems (SRDS)
000178636 773__ $$t2011 30Th Ieee International Symposium On Reliable Distributed Systems (Srds)$$q235-244
000178636 8564_ $$uhttps://infoscience.epfl.ch/record/178636/files/SRDS-2011.pdf$$zn/a$$s214419$$yn/a
000178636 909C0 $$xU10411$$0252206$$pLSR
000178636 909CO $$ooai:infoscience.tind.io:178636$$qGLOBAL_SET$$pconf$$pIC
000178636 917Z8 $$x106377
000178636 937__ $$aEPFL-CONF-178636
000178636 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000178636 980__ $$aCONF