Byzantine Fault Detectors for Solving Consensus

DOI10.1093/comjnl/46.1.16zbMath1027.68012OpenAlexW2096756359MaRDI QIDQ4415929

Kim Potter Kihlstrom, Louise E. Moser, P. Michael Melliar-Smith

Publication date: 7 August 2003

Published in: The Computer Journal (Search for Journal in Brave)

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

zbMATH Keywords

Byzantine faults

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14)

Related Items (6)

Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Consensus in the presence of mortal Byzantine faulty processes ⋮ On the Validity of Consensus ⋮ On Byzantine generals with alternative plans ⋮ Low complexity Byzantine-resilient consensus

This page was built for publication: Byzantine Fault Detectors for Solving Consensus