Constructs an amortized BRB protocol achieving optimal resilience and O(n|m|) communication in randomly asynchronous networks without erasure codes, plus an impossibility result for optimally resilient committee-based BRB in fully asynchronous networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
Constructs an amortized BRB protocol achieving optimal resilience and O(n|m|) communication in randomly asynchronous networks without erasure codes, plus an impossibility result for optimally resilient committee-based BRB in fully asynchronous networks.