Secure Message Transmission In Asynchronous Directed Networks

Shashank Agrawal; Abhinav Mehta; Kannan Srinathan

Paper 2011/013 Original: eprint.iacr.org/2011/013 ↗

Secure Message Transmission In Asynchronous Directed Networks

Shashank Agrawal

Abhinav Mehta

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.

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/013
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2011/013}
}