Clairvoyant state machine replication

DOI10.1016/J.IC.2021.104701MaRDI QIDQ2139098zbMATH OpenOpenAlexFDO

Authors Rida A. Bazzi, Maurice Herlihy

Publication date 17 May 2022

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

Full work available at URL https://arxiv.org/abs/1905.11607

zbMATH Keywords

ledgerconsensusgeneralizedByzantinestate machine

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Clairvoyant state machine replications
• Leaderless state-machine replication: specification, properties, limits
• Order-fairness for Byzantine consensus
• State machine replication under changing network conditions
• scientific article; zbMATH DE number 7561259

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Asynchronous secure computations with optimal resilience (extended abstract)
• Generalized Paxos made Byzantine (and less complex)
• Handling message semantics with Generic Broadcast protocols
• Impossibility of distributed consensus with one faulty process
• Keying hash functions for message authentication
• One-Step Consensus Solvability
• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• Time, clocks, and the ordering of events in a distributed system

Cited in

(6)

• Consensus on demand
• The unique chain rule and its applications
• scientific article; zbMATH DE number 7561259 (Why is no real title available?)
• Is it possible to clone using an arbitrary blank state?
• State machine replication under changing network conditions
• Leaderless state-machine replication: specification, properties, limits

This page was built for publication: Clairvoyant state machine replication

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