Paper 2011/320 Original: eprint.iacr.org/2011/320 ↗
Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
Abstract
In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded \emph{Byzantine} adversary that can corrupt a subset of nodes, so that Secure Message Transmission is possible between sender $S$ and receiver $R$. We also show that secure communication between a pair of nodes in a given synchronous directed network is possible in both directions if and only if reliable communication is possible between them. We assume that in a network, every node is capable of computation and we model the network along the lines of \cite{SR06}.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2011-06-17: last updated
- 2011-06-17: published
- Short URL
- https://ia.cr/2011/320
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/320,
author = {Manan Nayak and Shashank Agrawal and Kannan Srinathan},
title = {Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/320},
year = {2011},
url = {https://eprint.iacr.org/2011/320}
}