Paper 2011/014 Original: eprint.iacr.org/2011/014 ↗
Unconditionally Reliable Message Transmission in Directed Neighbour Networks
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
- Preprint.
- History
- 2011-01-08: last updated
- 2011-01-08: published
- Short URL
- https://ia.cr/2011/014
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}