Name
Abstract | ||
|---|---|---|
We 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/SRDS.2011.36 | Reliable Distributed Systems |
Keywords | Field | DocType |
computational complexity,fault tolerant computing,message passing,protocols,Byzantine consensus,Byzantine fault,atomic broadcast reduction,deterministic atomic broadcast reduction,time complexity,Atomic broadcast,Byzantine faults,Reduction,consensus | Atomic broadcast,Computer science,Byzantine architecture,Theoretical computer science,Time complexity,Quantum Byzantine agreement,Message passing,Semantics,Distributed computing,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1060-9857 | 978-1-4577-1349-1 | 6 |
PageRank | References | Authors |
0.48 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zarko Milosevic | 1 | 56 | 10.35 |
| Martin Hutle | 2 | 141 | 10.14 |
| André Schiper | 3 | 514 | 35.63 |