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 worst case time linear in the diameter of the network.
Original language | English |
---|---|
Pages (from-to) | 36-45 |
Number of pages | 10 |
Journal | IEEE Transactions on Industry Applications |
Volume | 27 |
Issue number | 1 pt 1 |
State | Published - Jan 1991 |
Externally published | Yes |
Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: 1 Oct 1989 → 5 Oct 1989 |