Title :
Secure communication in an unknown network with Byzantine faults
Author :
Burmester, Mike ; Desmedt, Y.G.
Author_Institution :
Dept. of Math., London Univ.
fDate :
4/16/1998 12:00:00 AM
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
Keywords :
directed graphs; message authentication; public key cryptography; Byzantine faults; authentication channels; secure communication; trust-graph;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19980538
