Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / reliable message transmission

Original Publication (with major differences): Information Processing Letters, Vol. 147; July 2019. Elsevier.
DOI:
10.1016/j.ipl.2019.02.011

Date: received 23 Oct 2017, last revised 10 May 2019

Contact author: rene at math aau dk

Available format(s): PDF | BibTeX Citation

Version: 20190510:180629 (All versions of this report)

Short URL: ia.cr/2017/1042


[ Cryptology ePrint archive ]