A simple Byzantine generals protocol

DOI10.1007/S10878-012-9534-3MaRDI QIDQ2015794zbMATH OpenOpenAlexFDO

Authors Junxing Wang

Publication date 24 June 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9534-3

zbMATH Keywords

Byzantine generals problemdistributed algorithmfault tolerant

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Impossibility of distributed consensus with one faulty process
• scientific article; zbMATH DE number 4058837
• Fast and simple distributed consensus
• A new solution for the Byzantine generals problem
• Fast Distributed Agreement

Cites work

• Authenticated Algorithms for Byzantine Agreement
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem

Cited in

(7)

• Performance study of Byzantine agreement protocol with artificial neural network
• Generalized Paxos made Byzantine (and less complex)
• A Simple Protocol Whose Proof Isn't
• The Weak Byzantine Generals Problem
• On Byzantine generals with alternative plans
• Generalized Paxos made Byzantine (and less complex)
• P systems and the Byzantine agreement

This page was built for publication: A simple Byzantine generals protocol

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