Unconditionally Reliable Message Transmission in Directed Neighbour Networks

Shashank Agrawal; Abhinav Mehta; Kannan Srinathan

Paper 2011/014

Unconditionally Reliable Message Transmission in Directed Neighbour Networks

Shashank Agrawal, Abhinav Mehta, and 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: information-theoretic security directed neighbour network Byzantine adversary
Contact author(s): shashank agrawal @ research iiit ac in
History: 2011-01-08: received
Short URL: https://ia.cr/2011/014
License: CC BY

BibTeX

@misc{cryptoeprint:2011/014,
      author = {Shashank Agrawal and Abhinav Mehta and Kannan Srinathan},
      title = {Unconditionally Reliable Message Transmission in Directed Neighbour Networks},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/014},
      year = {2011},
      url = {https://eprint.iacr.org/2011/014}
}