Paper 2022/052

Near-optimal Balanced Reliable Broadcast and Asynchronous Verifiable Information Dispersal

Sourav Das, Zhuolun Xiang, and Ling Ren

Abstract

In this paper, we present near-optimal asynchronous Byzantine reliable broadcast (RBC) protocols with balanced costs and an improved asynchronous verifiable information dispersal (AVID) protocol. Assuming the existence of collision-resistant hash functions, our RBC protocol broadcasts a message M among n nodes with total communication cost O(n|M|+κn2) and per-node communication cost O(|M|+κn). In contrast, the state-of-the-art reliable broadcast protocol either has per-node cost O(|M|+κlogn), or has imbalanced costs where the broadcaster incurs O(n|M|) while other nodes incur a communication cost of O(|M|+κn). We also present an error-free RBC protocol that makes no computational assumption and has total communication cost O(n|M|+n2logn) and per-node communication cost O(|M|+nlogn). In contrast, the state-of-the-art error-free RBC protocol has total cost of , and the broadcaster has imbalanced cost of . We then use our new balanced RBC and additional techniques to design an asynchronous verifiable information dispersal (AVID) protocol with total dispersal cost , retrieval cost , and no trusted setup. In our AVID protocol, the client incurs a communication cost of in comparison to of prior best. Moreover, each node in our AVID protocol incurs a storage cost of bits, in comparison to bits of prior best. Finally, we present lower bound results on communication cost and show that our balanced RBC and AVID protocols have near-optimal communication costs -- only an factor of or gap from the lower bounds.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Asynchronous NetworksReliable BroadcastCommunication ComplexityLower Bounds.
Contact author(s)
souravd2 @ illinois edu
renling @ illinois edu
xiangzl @ illinois edu
History
2022-02-14: revised
2022-01-18: received
See all versions
Short URL
https://ia.cr/2022/052
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/052,
      author = {Sourav Das and Zhuolun Xiang and Ling Ren},
      title = {Near-optimal Balanced Reliable Broadcast and Asynchronous Verifiable Information Dispersal},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/052},
      year = {2022},
      url = {https://eprint.iacr.org/2022/052}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.