Paper 2013/553 Original: eprint.iacr.org/2013/553 ↗
Multi-Valued Byzantine Broadcast: the $t < n$ Case
Abstract
All known protocols implementing broadcast from synchronous point-to-point channels tolerating any $t < n$ Byzantine corruptions have communication complexity at least $\Omega(\ell n^2)$. We give cryptographically secure and information-theoretically secure protocols for $t < n$ that communicate $O(\ell n)$ bits in order to broadcast sufficiently long $\ell$ bit messages. This matches the optimal communication complexity bound for any protocol allowing to broadcast $\ell$ bit messages. While broadcast protocols with the optimal communication complexity exist in cases where $t < n/3$ (by Liang and Vaidya in PODC '11) or $t < n/2$ (by Fitzi and Hirt in PODC '06), this paper is the first to present such protocols for $t < n$.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2014-05-26: last updated
- 2013-09-04: published
- Short URL
- https://ia.cr/2013/553
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/553,
author = {Martin Hirt and Pavel Raykov},
title = {Multi-Valued Byzantine Broadcast: the $t < n$ Case},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/553},
year = {2013},
url = {https://eprint.iacr.org/2013/553}
}