Cryptology ePrint Archive: Report 2022/264

Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security

Ittai Abraham and Gilad Asharov

Abstract: We revisit Gradecast (Feldman and Micali, STOC’88) in Synchrony and Reliable Broadcast (Bracha, Information and Computation’87) in Asynchrony. For both tasks, we provide new protocols that have three desirable properties: (1) optimal resilience, tolerating $t < n/3$ malicious parties; (2) are communication-efficient, where honest parties send just $O(nL)$ bits for a dealer with a message of $L = \Omega(n)$ bits; (3) and are unconditionally secure, (or statistically secure), without needing to rely on any computational or setup assumptions. To the best of our knowledge, no previous work obtains all three properties simultaneously.

Category / Keywords: cryptographic protocols / gradecast, reliable broadcast

Date: received 27 Feb 2022, last revised 3 Mar 2022

Contact author: iabraham at vmware com, Gilad Asharov at biu ac il

Available format(s): PDF | BibTeX Citation

Version: 20220303:131612 (All versions of this report)

Short URL: ia.cr/2022/264