A committee-based Byzantine agreement protocol claims to improve adaptive-adversary round complexity over Chor-Coan, but its stated bound and core proof have serious gaps.
Scalable and secure computation among strangers: Message-competitive byzantine protocols
1 Pith paper cite this work, alongside 5 external citations. Polarity classification is still indexing.
1
Pith paper citing it
5
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Improved Byzantine Agreement under an Adaptive Adversary
A committee-based Byzantine agreement protocol claims to improve adaptive-adversary round complexity over Chor-Coan, but its stated bound and core proof have serious gaps.