Welcome to the resource topic for 2013/553
Title:
Multi-Valued Byzantine Broadcast: the t < n Case
Authors: Martin Hirt, 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.
ePrint: https://eprint.iacr.org/2013/553
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .