Abstract
We study the problem of perfectly secure communication in a general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three 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 | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| State | Published - 1990 |
| Externally published | Yes |
| Event | Proceedings of the 31st Annual Symposium on Foundations of Computer Science - St. Louis, MO, USA Duration: 22 Oct 1990 → 24 Oct 1990 |
Bibliographical note
Publisher Copyright:©1990 IEEE.
Fingerprint
Dive into the research topics of 'Perfectly Secure Message Transmission'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver