Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
| Hi-index | 0.00 |
The Byzantine Agreement (BA) problem introduced by Pease, Shostak and Lamport in [1] is one of the central problems in distributed computing. It was extensively studied under various timing, topology, authentication and failure assumptions. In previous works it was assumed that the network topology is known to the processors in advance, i.e., every processor has an a priori knowledge of the true unique identi.er of the processor to which it is connected by each of its communication channels (see Fig. 1a).