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.
Alsberg and John D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 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.