Simple constant-time consensus protocols in realistic failure models

DOI10.1145/65950.65956MaRDI QIDQ3830798zbMATH OpenOpenAlexFDO

Authors Benny Chor, Michael Merritt, David B. Shmoys

Publication date 1989

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/65950.65956

zbMATH Keywords

agreement problemcryptographyfault tolerancerandomized protocols for consensus

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Randomized protocols for asynchronous consensus
• Stopping times of distributed consensus protocols: a probabilistic analysis
• Randomized Consensus in Expected O(N\log ^2 N) Operations Per Processor
• Lower bounds for distributed coin-flipping and randomized consensus
• Communication-efficient randomized consensus

Cited in

(27)

• Stopping times of distributed consensus protocols: a probabilistic analysis
• Sublinear-round Byzantine agreement under corrupt majority
• Communication-efficient randomized consensus
• Broadcast-optimal two-round MPC
• Unbeatable consensus
• On the round complexity of randomized Byzantine agreement
• Round-optimal Byzantine agreement
• Efficient player-optimal protocols for strong and differential consensus
• Flipping Persuasively in Constant Time
• Continuous Consensus with Failures and Recoveries
• Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Hundreds of impossibility results for distributed computing
• Timeliness, failure-detectors, and consensus performance
• Continuous Consensus with Ambiguous Failures
• Brief Announcement: Improved Consensus in Quantum Networks
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Randomization and failure detection: a hybrid approach to solve consensus
• On the round complexity of fully secure solitary MPC with honest majority
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Simplex consensus: a simple and fast consensus protocol
• Distributed fast crash-tolerant consensus with nearly-linear quantum communication
• Round-optimal Byzantine agreement without trusted setup
• Simultaneity is harder than agreement
• Adaptive timeliness of consensus in presence of crash and timing faults
• Transaction commit in a realistic timing model
• Continuous consensus with ambiguous failures

This page was built for publication: Simple constant-time consensus protocols in realistic failure models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830798)