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

DOI10.1016/0020-0190(90)90185-ZMaRDI QIDQ916352zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the round complexity of randomized Byzantine agreement
• Almost-surely terminating asynchronous Byzantine agreement revisited
• On the round complexity of randomized Byzantine agreement
• Byzantine agreement in the full-information model in \(O(\log n)\) rounds
• Fast Byzantine agreement

Cites work

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

Cited in

(9)

• EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
• MPC with synchronous security and asynchronous responsiveness
• Randomization and failure detection: a hybrid approach to solve consensus
• Probabilistic termination and composability of cryptographic protocols
• Asymptotically free broadcast in constant expected time via packed VSS
• Almost-surely terminating asynchronous Byzantine agreement revisited
• Probabilistic Termination and Composability of Cryptographic Protocols
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Randomized protocols for asynchronous consensus

This page was built for publication: The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916352)