Consensus on demand

DOI10.1007/978-3-031-21017-4_20zbMath1522.68070arXiv2202.03756MaRDI QIDQ6155257

Jakub Sliwinski, Yann Vonlanthen, Roger Wattenhofer

Publication date: 12 June 2023

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

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

zbMATH Keywords

fault toleranceconsensusreliable broadcastblockchaincryptocurrency

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Asynchronous byzantine agreement protocols
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Lower bounds for asynchronous consensus
• Clairvoyant state machine replication
• Generalized Paxos made Byzantine (and less complex)
• Bosco: One-Step Byzantine Asynchronous Consensus
• Asynchronous consensus and broadcast protocols
• The Consensus Number of a Cryptocurrency
• HotStuff
• Replicated data types
• Unnamed Item

This page was built for publication: Consensus on demand