Byzantine-resistant total ordering algorithms.
From MaRDI portal
Recommendations
- Total ordering algorithms for asynchronous Byzantine systems
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- Order-fairness for Byzantine consensus
- Efficient algorithms for anonymous Byzantine agreement
- Byzantine agreement in polynomial time with near-optimal resilience
- An Efficient Byzantine-Resilient Tuple Space
- Asynchronous Byzantine agreement with optimal resilience
- A secure multi-party computation protocol for the sorting problem
Cites work
- scientific article; zbMATH DE number 595498 (Why is no real title available?)
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- Asynchronous byzantine agreement protocols
- Asynchronous consensus and broadcast protocols
- Consensus algorithms with one-bit messages
- Fast Distributed Agreement
- Impossibility of distributed consensus with one faulty process
- Optimal amortized distributed consensus
- Reaching Agreement in the Presence of Faults
- The weakest failure detector for solving consensus
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
Cited in
(8)- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- Total ordering group communication protocol based on coordinating sequencers for multiple overlapping groups
- A classification of total order specifications and its application to fixed sequencer-based implementations
- \textsc{FnF-BFT}: a BFT protocol with provable performance under attack
- Computational Science - ICCS 2004
- Total ordering algorithms for asynchronous Byzantine systems
- Research and implementation of total-ordered multicast protocol considering overlapped groups
This page was built for publication: Byzantine-resistant total ordering algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854265)
