Welcome to the resource topic for 2011/014
Title:
Unconditionally Reliable Message Transmission in Directed Neighbour Networks
Authors: Shashank Agrawal, Abhinav Mehta, Kannan Srinathan
Abstract:The problem of unconditionally reliable message transmission (URMT) is to design a protocol which when run by players in a network enables a sender S to deliver a message to a receiver R with high probability, even when some players in the network are under the control of an unbounded adversary. Renault and Tomala [JoC2008] gave a characterization of undirected neighbour networks over which URMT tolerating Byzantine adversary is possible. In this paper, we generalize their result to the case of directed networks.
ePrint: https://eprint.iacr.org/2011/014
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 .