| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429262 | Information Processing Letters | 2006 | 6 Pages |
Abstract
We consider the problem of reliable message transmission between two synchronous players connected by n wires, some of which may be faulty. We show how to get reliability “for free”—reliable transmission of b bits involves a total communication of only O(b) bits, when b is large enough. We also construct an efficient Perfectly Secure Message Transmission Protocol.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
