Byzantine-tolerant causal broadcast
From MaRDI portal
Publication:1981768
DOI10.1016/j.tcs.2021.06.021OpenAlexW3176240629MaRDI QIDQ1981768
Alex Auvolat, François Taïani, Davide Frey, Michel Raynal
Publication date: 6 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03346710/file/Byz-CO-broadcast-TCS_20200702.pdf
algorithmfault-tolerancemodularitysimplicityreliable broadcastasynchronous message-passing systemByzantine processcausal message delivery
Uses Software
Cites Work
- Asynchronous byzantine agreement protocols
- The causal ordering abstraction and a simple way to implement it
- Detecting causal relationships in distributed computations: In search of the holy grail
- Crash-tolerant causal broadcast in \(O(n)\) messages
- Chapar: certified causally consistent distributed key-value stores
- Introduction to Reliable and Secure Distributed Programming
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- Time, clocks, and the ordering of events in a distributed system
- Atomic snapshots of shared memory
- Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
- Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
- The Consensus Number of a Cryptocurrency
- Fault-Tolerant Message-Passing Distributed Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Byzantine-tolerant causal broadcast
