Perfectly Secure Message Transmission Revisited

Secure communications guaranteeing reliability and privacy (without unproven assumptions) in networks with active adversaries has been an important research issue. It has been studied for point to point networks by Dolev-Dwork-Waarts-Yung (J. ACM 1993), Desmedt-Wang (Eurocrypt 2002), and Srinathan-Narayanan-Rangan (Crypto 2004). Dolev-Dwork-Waarts-Yung gave necessary and sufficient conditions for secure communication in networks with the condition that (1) all the channels are two-way; or (2) all the channels are one-way from the sender to the receiver. In this paper, we study the general case with a network modeled by a directed graph. In this general case, there are communication channels from the sender to the receiver and there are feedback channels from the receiver to the sender. We give necessary and sufficient bounds on the number of channels that are required from sender to receiver given a number of ldquofeedbackrdquo channels from receiver to sender. We give these bounds for the case reliability is perfect, as well as for the case it is not perfect.

[1]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[2]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

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

[4]  K. Srinathan,et al.  On perfectly secure communication over arbitrary networks , 2002, PODC '02.

[5]  Nathan Linial,et al.  Fault-Tolerant Computation in the Full Information Model , 1998, SIAM J. Comput..

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

[7]  Tal Rabin,et al.  Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.

[8]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[9]  Matthew K. Franklin,et al.  Secure hypergraphs: privacy from partial broadcast , 1995, STOC '95.

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

[11]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[12]  Matthew K. Franklin,et al.  Secure Communication in Minimal Connectivity Models , 1998, Journal of Cryptology.

[13]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[14]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[15]  Keith M. Martin,et al.  Combinatorial models for perfect secret sharing schemes , 1998 .

[16]  Yongge Wang,et al.  Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question , 2001, Journal of Cryptology.

[17]  K. Srinathan,et al.  Optimal Perfectly Secure Message Transmission , 2004, CRYPTO.

[18]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[19]  Nathan Linial,et al.  Fault-tolerant computation in the full information model , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[20]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[21]  Yongge Wang,et al.  Perfectly Secure Message Transmission Revisited , 2008, IEEE Trans. Inf. Theory.