Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds

DOI10.1137/S0097539794265232MaRDI QIDQ4388871zbMATH OpenOpenAlexFDO

Authors Juan Garay, Yoram Moses

Publication date 10 May 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794265232

zbMATH Keywords

Byzantine agreementcomputer securityconsensusdistributed computingfault tolerance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Byzantine agreement in polynomial time with near-optimal resilience
• Byzantine Agreement in Expected Polynomial Time
• Byzantine agreement in polynomial expected time (extended abstract)
• An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
• Round-optimal Byzantine agreement
• Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
• On the round complexity of randomized Byzantine agreement
• On the round complexity of randomized Byzantine agreement
• Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback

Cited in

(39)

• On expected constant-round protocols for Byzantine agreement
• On the round complexity of Byzantine agreement without initial set-up
• Efficient agreement using fault diagnosis.
• A flexible formal framework for masking/demasking faults
• Quantum Byzantine agreement with tripartite entangled states
• Agreement in synchronous networks with ubiquitous faults
• Reliable broadcast with respect to topology knowledge
• Efficient algorithms for anonymous Byzantine agreement
• The Byzantine generals problem in generic and wireless networks
• Byzantine agreement in the full-information model in O( n) rounds
• Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
• Secure message transmission by public discussion: a brief survey
• Byzantine Agreement in Expected Polynomial Time
• Early stopping in Byzantine agreement
• An O (log n ) expected rounds randomized byzantine generals protocol
• scientific article; zbMATH DE number 4039274 (Why is no real title available?)
• Message-optimal protocols for Byzantine Agreement
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Robust and scalable middleware for selfish-computer systems
• Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
• Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
• Fast Byzantine agreement
• Continuous Consensus with Ambiguous Failures
• Byzantine agreement with homonyms
• Distributed CONGEST Algorithms against Mobile Adversaries
• Fast agreement in networks with Byzantine nodes
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Early stopping for any number of corruptions
• Sublinear message bounds of authenticated implicit Byzantine agreement
• Asymptotically optimal early termination for dishonest majority broadcast
• Early stopping Byzantine agreement in (1+ ) f rounds
• Byzantine agreement with optimal resilience via statistical fraud detection
• Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound
• Invited talk: Resilient distributed algorithms
• Robust gossiping with an application to consensus
• The perfectly synchronized round-based model of distributed computing
• Game authority for robust and scalable distributed selfish-computer systems
• Continuous consensus with ambiguous failures

This page was built for publication: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds

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