Answers are grounded in this paper and cite their sources.
Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the “random oracle” model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem is presented and analyzed.
No takes yet. Share an insight, caveat, or question.
Cachin et al. (2000) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: