A randomized algorithm achieves O(n log n/(γk)) per-peer queries for Byzantine-resilient Download with any fault fraction β<1, plus dynamic-adversary and crash-fault protocols and a single-round lower bound.
Byzantine agreement and leader election: From classical to the modern
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Distributed Download from an External Data Source in Faulty Majority Settings
A randomized algorithm achieves O(n log n/(γk)) per-peer queries for Byzantine-resilient Download with any fault fraction β<1, plus dynamic-adversary and crash-fault protocols and a single-round lower bound.