Welcome to the resource topic for
**2008/393**

**Title:**

How Far Must You See To Hear Reliably

**Authors:**
Pranav K Vasishta, Anuj Gupta, Prasant Gopal, Piyush Bansal, Rishabh Mukherjee, Poornima M, Kannan Srinathan, Kishore Kothapalli

**Abstract:**

We consider the problem of probabilistic reliable communication (PRC) over synchronous networks modeled as directed graphs in the presence of a Byzantine adversary when players’ knowledge of the network topology is not complete. 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 \cite{DDWY93:PSMT,SKR05}. We introduce a novel model for quantifying players’ knowledge of network topology, denoted by {\mathcal TK}. Given a directed graph G, influenced by a Byzantine adversary that can corrupt up to any t players, we give a necessary and sufficient condition for possibility of PRC over G for any arbitrary topology knowledge {\mathcal TK}. It follows from our main characterization theorem that knowledge of up to d = \lfloor \frac{n - 2t}{3} \rfloor + 1 levels is sufficient for the solvability of honest player to honest player communication over any network over which PRC is possible when each player has complete knowledge of the topology. We also show the existence of networks where PRC is possible when players have complete topology knowledge but it is not possible when the players do not have knowledge of up to d = \lfloor \frac{n - 2t}{3} \rfloor + 1 levels.

**ePrint:**
https://eprint.iacr.org/2008/393

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .