Perfectly secure message transmission
Journal of the ACM (JACM)
Reliable broadcast in unknown fixed-identity networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Unconditionally reliable message transmission in directed networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We consider the problem of probabilistic reliable communication (PRC) over directed networks: Over a synchronous directed network N} = (P,E) where P is the set of vertices and E denotes the set of arcs/edges in the network, the sender S ∈ P wishes to send a message m to the receiver R ∈ P in a robust manner such that the message is correctly received by R with a very high probability, in spite of the presence of up to t Byzantine-faulty nodes in N. We ask the specific question if PRC is affected when the players have only partial knowledge of the network topology. We show that possibility of PRC is extremely sensitive to the changes in players' knowledge of the topology. This is in complete contrast with earlier known results on the possibility of perfectly reliable communication over undirected graphs where the case of each player knowing only its neighbours gives the same result as the case where players have complete knowledge of the network. Specifically, in either case, (2t + 1)-vertex connectivity is necessary and sufficient, where t is the number of nodes that can be corrupted by the adversary [1, 3]. In this work, we show an example where partial knowledge of the topology results in the failure of PRC, whereas complete knowledge of the same, makes PRC possible.