Generalized Paxos made Byzantine (and less complex)

DOI10.1007/978-3-319-69084-1_14MaRDI QIDQ5045443zbMATH OpenOpenAlexFDO

Authors

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69084-1_14

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Generalized Paxos made Byzantine (and less complex)
• A simple Byzantine generals protocol
• Paxos consensus, deconstructed and abstracted
• Brief announcement: A family of leaderless generalized-consensus algorithms
• Revisiting the PAXOS algorithm

Cited in

(4)

• Clairvoyant state machine replication
• On the correctness of Egalitarian Paxos
• Generalized Paxos made Byzantine (and less complex)
• Brief announcement: A family of leaderless generalized-consensus algorithms

This page was built for publication: Generalized Paxos made Byzantine (and less complex)

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