The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols

DOI10.1016/0020-0190(90)90185-ZzbMath0703.68020OpenAlexW2076095675MaRDI QIDQ916352

Oded Goldreich, Erez Petrank

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90185-z

zbMATH Keywords

distributed computingrandomized algorithmsByzantine Agreement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items

EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS, Asymptotically free broadcast in constant expected time via packed VSS, MPC with synchronous security and asynchronous responsiveness, Randomized protocols for asynchronous consensus, Probabilistic Termination and Composability of Cryptographic Protocols, Probabilistic termination and composability of cryptographic protocols

Cites Work

• Simultaneity is harder than agreement
• A lower bound for the time to assure interactive consistency
• Impossibility of distributed consensus with one faulty process
• An O (log n ) expected rounds randomized byzantine generals protocol
• Reaching Agreement in the Presence of Faults