Resource-competitive randomized protocol for Byzantine agreement in unknown-identity synchronous networks achieves expected O((T+n) log n) bits sent by honest nodes and polylog latency, resilient to (1/4-ε)n faults with high probability.
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
Resource-competitive randomized protocol for Byzantine agreement in unknown-identity synchronous networks achieves expected O((T+n) log n) bits sent by honest nodes and polylog latency, resilient to (1/4-ε)n faults with high probability.