DocumentCode
2775504
Title
Perfectly secure message transmission
Author
Dolev, Danny ; Dwork, Cynthia ; Waarts, Orli ; Yung, Moti
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
fYear
1990
fDate
22-24 Oct 1990
Firstpage
36
Abstract
The problem of perfectly secure communication in a general network in which processors and communication lines may be faulty is studied. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms that operate with this connectivity and rely on no complexity theoretic assumptions are derived. These are the first algorithms for secure communication in a general network to achieve simultaneously the goals of perfect secrecy, perfect resiliency, and a worst case time which is linear in the diameter of the network
Keywords
computational complexity; protocols; security of data; connectivity; efficient algorithms; faulty communication lines; faulty processors; general network; network diameter; perfect resiliency; perfect secrecy; perfectly secure communication; secure message transmission; worst case time; Bandwidth; Communication networks; Computer networks; Contracts; Costs; Optical fibers; Privacy; Protocols; Surface-mount technology; Wires;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-2082-X
Type
conf
DOI
10.1109/FSCS.1990.89522
Filename
89522
Link To Document