Short Note on Complexity of Multi-Value Byzantine Agreement
classification
💻 cs.DC
cs.CR
keywords
achievesagreementbyzantinecomplexityalgorithmhighmulti-valuemulti-valued
read the original abstract
Randomized algorithm that achieves multi-valued Byzantine agreement with high probability, and achieves optimal complexity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.