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

Martin Hirt; Pavel Raykov

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 $Ω (ℓ n^{2})$ . We give cryptographically secure and information-theoretically secure protocols for $t < n$ that communicate $O (ℓ n)$ bits in order to broadcast sufficiently long $ℓ$ bit messages. This matches the optimal communication complexity bound for any protocol allowing to broadcast $ℓ$ 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: byzantine multi-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: CC BY

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}
}

Paper 2013/553

Multi-Valued Byzantine Broadcast: the t<n Case

Abstract

Metadata

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