### Secure Message Transmission In Asynchronous Directed Networks

Shashank Agrawal, Abhinav Mehta, and Kannan Srinathan

##### Abstract

We study the problem of information-theoretically secure message transmission (SMT) in asynchronous directed networks. In line with the literature, the distrust and failures of the network is captured via a computationally unbounded Byzantine adversary that may corrupt some subset of nodes. We give a characterization of networks over which SMT from sender S to receiver R is possible in both the well-known settings, namely perfect SMT (PSMT) and unconditional SMT (USMT). We distinguish between two variants of USMT: one in which R can output an incorrect message (with small probability) and another in which R never outputs a wrong message, but may choose to abort (with small probability). We also provide efficient protocols for an important class of networks.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Contact author(s)
shashank agrawal @ research iiit ac in
History
Short URL
https://ia.cr/2011/013

CC BY

BibTeX

@misc{cryptoeprint:2011/013,
author = {Shashank Agrawal and Abhinav Mehta and Kannan Srinathan},
title = {Secure Message Transmission In Asynchronous Directed Networks},
howpublished = {Cryptology ePrint Archive, Paper 2011/013},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/013}},
url = {https://eprint.iacr.org/2011/013}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.