Agreement Among Unacquainted Byzantine Generals

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).