Proceedings  31st Annual Symposium on Foundations of Computer Science (1990)
St. Louis, MO, USA
Oct. 22, 1990 to Oct. 24, 1990
pp: 36-45 vol.1
D. Dolev , IBM Almaden Res. Center, San Jose, CA, USA
C. Dwork , IBM Almaden Res. Center, San Jose, CA, USA
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.
worst case time, faulty processors, faulty communication lines, efficient algorithms, network diameter, secure message transmission, perfectly secure communication, connectivity, general network, perfect secrecy, perfect resiliency
D. Dolev, O. Waarts, M. Yung and C. Dwork, "Perfectly secure message transmission," Proceedings  31st Annual Symposium on Foundations of Computer Science(FOCS), St. Louis, MO, USA, 1990, pp. 36-45 vol.1.