Perfectly secure message transmission
Authors:
- O. WaartsOWO. Waarts
- M. YungMYM. Yung
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 36-45
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
This publication has 7 references indexed in Scilit:
- Verifiable secret sharing and multiparty protocols with honest majority1989
- Optimal algorithms for Byzantine agreement1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- How to play ANY mental game1987
- Verifiable secret sharing and achieving simultaneity in the presence of faults1985
- On sharing secrets and Reed-Solomon codesCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979