On one-round reliable message transmission

René Bødker Christensen

Paper 2017/1042

On one-round reliable message transmission

René Bødker Christensen

Abstract

In this paper, we consider one-round protocols for reliable message transmission (RMT) when $t$ out of $n=2t+1$ available channels are controlled by an adversary. We show impossibility of constructing such a protocol that achieves a transmission rate of less than $\Theta(n)$ for constant-size messages and arbitrary reliability parameter. In addition, we show how to improve two existing protocols for RMT to allow for either larger messages or reduced field sizes.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Major revision. Information Processing Letters, Vol. 147; July 2019. Elsevier.
DOI: 10.1016/j.ipl.2019.02.011
Keywords: reliable message transmission
Contact author(s): rene @ math aau dk
History: 2019-05-10: revised; 2017-10-28: received; See all versions
Short URL: https://ia.cr/2017/1042
License: CC BY

BibTeX

@misc{cryptoeprint:2017/1042,
      author = {René Bødker Christensen},
      title = {On one-round reliable message transmission},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/1042},
      year = {2017},
      doi = {10.1016/j.ipl.2019.02.011},
      url = {https://eprint.iacr.org/2017/1042}
}