The authors formalize cluster-sending between Byzantine clusters, prove linear lower bounds on message and certificate complexity, and present protocols that achieve these bounds.
The next 700 bft protocols
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The fault-tolerant cluster-sending problem
The authors formalize cluster-sending between Byzantine clusters, prove linear lower bounds on message and certificate complexity, and present protocols that achieve these bounds.