Secure communication in an unknown network with Byzantine faults

Abstract

The authors consider the problem of secure communication in a network for which the trust-graph (with vertices of the processors and edges corresponding to authentication channels) is unknown to all but one non-faulty processor. It is shown that secure communication is obtained if the trust-graph is sufficiently connected.