Clairvoyant state machine replication

DOI10.1016/j.ic.2021.104701OpenAlexW3120892251MaRDI QIDQ2139098

Rida A. Bazzi, Maurice P. 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

ledgerconsensusstate machinegeneralizedByzantine

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Consensus on demand

Cites Work

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

This page was built for publication: Clairvoyant state machine replication