Byzantine-resistant total ordering algorithms.
type: Item
instance of: scholarly article
title: Byzantine-resistant total ordering algorithms.
zbMATH Open document ID: 1045.68502
author: L. E. Moser
author: P. M. Melliar-Smith
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1853031
zbMATH Keywords: Multicast group communication protocols
zbMATH Keywords: Byzantine process faults
describes a project that uses: Horus
MaRDI profile type: Publication
full work available at URL: inco.1998.2770
OpenAlex ID: W1982092505
cites work: Optimal amortized distributed consensus
cites work: Consensus algorithms with one-bit messages
cites work: Asynchronous byzantine agreement protocols
cites work: Asynchronous consensus and broadcast protocols
cites work: Unreliable failure detectors for reliable distributed systems
cites work: The weakest failure detector for solving consensus
cites work: Impossibility of distributed consensus with one faulty process
cites work: Q4296971
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Asynchronous Fault-Tolerant Total Ordering Algorithms
cites work: Reaching Agreement in the Presence of Faults
cites work: Fast Distributed Agreement
DOI: 10.1006/INCO.1998.2770
Recommended article: Total ordering algorithms for asynchronous Byzantine systems
Recommended article: Asynchronous Fault-Tolerant Total Ordering Algorithms
Recommended article: Order-fairness for Byzantine consensus
Recommended article: Efficient algorithms for anonymous Byzantine agreement
Recommended article: Byzantine agreement in polynomial time with near-optimal resilience
Recommended article: An Efficient Byzantine-Resilient Tuple Space
Recommended article: Asynchronous Byzantine agreement with optimal resilience
Recommended article: Q5322675
description: scientific article; zbMATH DE number 1853031