DocumentCode
1378026
Title
Secure communication in an unknown network with Byzantine faults
Author
Burmester, Mike ; Desmedt, Y.G.
Author_Institution
Dept. of Math., London Univ.
Volume
34
Issue
8
fYear
1998
fDate
4/16/1998 12:00:00 AM
Firstpage
741
Lastpage
742
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;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19980538
Filename
674891
Link To Document