论文信息 - Perfectly Reliable Message Transmission

Perfectly Reliable Message Transmission

We consider the problem of reliable message transmission between two synchronous players connected by n wires, some t < n/2 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.

K. Srinathan | C. Pandu Rangan | Arvind Narayanan

[1] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .

[2] Hosame Abu-Amara,et al. Efficient Perfectly Secure Message Transmission in Synchronous Networks , 1996, Inf. Comput..

[3] K. Srinathan,et al. Brief announcement: efficient perfectly secure communication over synchronous networks , 2003, PODC '03.

[4] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.

[5] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[6] Yongge Wang,et al. Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.

[7] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.