Paper 2024/571 Original: eprint.iacr.org/2024/571 ↗
MiniCast: Minimizing the Communication Complexity of Reliable Broadcast
Abstract
We give a new protocol for reliable broadcast with improved communication complexity for long messages. Namely, to reliably broadcast a message a message $m$ over an asynchronous network to a set of $n$ parties, of which fewer than $n/3$ may be corrupt, our protocol achieves a communication complexity of $1.5 |m| n + O( \kappa n^2 \log(n) )$, where $\kappa$ is the output length of a collision-resistant hash function. This result improves on the previously best known bound for long messages of $2 |m| n + O( \kappa n^2 \log(n) )$.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-04-26: last updated
- 2024-04-15: published
- Short URL
- https://ia.cr/2024/571
- License
- https://creativecommons.org/licenses/by-nc-nd/4.0/
BibTeX
@misc{cryptoeprint:2024/571,
author = {Thomas Locher and Victor Shoup},
title = {MiniCast: Minimizing the Communication Complexity of Reliable Broadcast},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/571},
year = {2024},
url = {https://eprint.iacr.org/2024/571}
}