Paper 2008/141 Original: eprint.iacr.org/2008/141 ↗

Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality

Arpita Patra
Ashish Choudhury
C. Pandu Rangan
Kannan Srinathan
Abstract

We study the interplay of network connectivity and the issues related to the ‘possibility’, ‘feasibility’ and ‘optimality’ for unconditionally reliable message transmission (URMT) and unconditionally secure message transmission (USMT) in an undirected synchronous network, under the influence of an adaptive mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, omission, fail-stop and passive fashion respectively. We consider two types of adversary, namely threshold and non-threshold. One of the important conclusions we arrive at from our study is that allowing a negligible error probability significantly helps in the ‘possibility’, ‘feasibility’ and ‘optimality’ of both reliable and secure message transmission protocols. To design our protocols, we propose several new techniques which are of independent interest.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2011-01-18: last updated
2008-03-31: published
Short URL
https://ia.cr/2008/141
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2008/141,
      author = {Arpita Patra and Ashish Choudhury and C.  Pandu Rangan and Kannan Srinathan},
      title = {Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/141},
      year = {2008},
      url = {https://eprint.iacr.org/2008/141}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.