You are looking at a specific version 20171028:204740 of this paper.
See the latest version.
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)
- Category
- Cryptographic protocols
- Publication info
- Preprint. MAJOR revision.
- 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