Welcome to the resource topic for 2024/1656
Title:
Optimal Early Termination for Dishonest Majority Broadcast
Authors: Giovanni Deligios, Ivana Klasovita, Chen-Da Liu-Zhang
Abstract:Deterministic broadcast protocols among n parties tolerating t corruptions require \min\{f+2, t+1\} rounds, where f \le t is the actual number of corruptions in an execution of the protocol. We provide the first protocol which is optimally resilient, adaptively secure, and asymptotically matches this lower bound for any t<(1-\varepsilon)n. By contrast, the best known algorithm in this regime by Loss and Nielsen (EUROCRYPT’24) always requires O(\min\{f^2, t\}) rounds. Our main technical tool is a generalization of the notion of polarizer introduced by Loss and Nielsen, which allows parties to obtain transferable cryptographic evidence of missing messages with fewer rounds of interaction.
ePrint: https://eprint.iacr.org/2024/1656
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 .