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

DOI10.1137/S0097539794265232zbMath0911.68006OpenAlexW2077246908MaRDI QIDQ4388871

Juan A. 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

fault tolerancedistributed computingcomputer securityconsensusByzantine agreement

Mathematics Subject Classification ID

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

Related Items (18)

Invited talk: Resilient distributed algorithms ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Robust gossiping with an application to consensus ⋮ The Byzantine Generals Problem in Generic and Wireless Networks ⋮ Reliable broadcast with respect to topology knowledge ⋮ The perfectly synchronized round-based model of distributed computing ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Game authority for robust and scalable distributed selfish-computer systems ⋮ Continuous consensus with ambiguous failures ⋮ Continuous Consensus with Ambiguous Failures ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Byzantine agreement with homonyms ⋮ A flexible formal framework for masking/demasking faults ⋮ Quantum Byzantine agreement with tripartite entangled states ⋮ On the round complexity of Byzantine agreement without initial set-up

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