A tradeoff between safety and liveness for randomized coordinated attack

DOI10.1006/INCO.1996.0063zbMATH Open0856.68061OpenAlexW2034843181MaRDI QIDQ1923091FDOQ1923091

Authors: George Varghese, Nancy Lynch 

Publication date: 3 February 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c12be4edcc77a663826c7f834e73897259842844

Recommendations

• A tradeoff between safety and liveness for randomized coordinated attack protocols
• Simultaneity is harder than agreement
• On the round complexity of randomized Byzantine agreement
• Back to the coordinated attack problem
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

zbMATH Keywords

coordinated attacksynchronous protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (3)

• How to safely close a discussion
• A tradeoff between safety and liveness for randomized coordinated attack protocols
• Randomization can be a healer: consensus with dynamic omission failures

This page was built for publication: A tradeoff between safety and liveness for randomized coordinated attack

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