Welcome to the resource topic for 2011/320
Title:
Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
Authors: Manan Nayak, Shashank Agrawal, Kannan Srinathan
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}.
ePrint: https://eprint.iacr.org/2011/320
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 .