You are looking at a specific version 20140131:103531 of this paper. See the latest version.

Paper 2013/553

Multi-Valued Byzantine Broadcast: the $t < n$ Case

Martin Hirt and Pavel Raykov

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. MINOR revision.
Keywords
byzantinemulti-valued broadcast
Contact author(s)
raykov pavel @ gmail com
History
2014-05-26: last of 3 revisions
2013-09-04: received
See all versions
Short URL
https://ia.cr/2013/553
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.