Low complexity Byzantine-resilient consensus

DOI10.1007/S00446-004-0110-7zbMath1264.68027DBLPjournals/dc/CorreiaNLV05OpenAlexW2125607361WikidataQ57603737 ScholiaQ57603737MaRDI QIDQ1953244

Nuno Ferreira Neves, Lau Cheuk Lung, Miguel Correia

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://repositorio.ul.pt/handle/10455/2939

zbMATH Keywords

distributed algorithmsconsensusintrusion toleranceByzantine fault tolerancedistributed systems models

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

Consensus in the presence of mortal Byzantine faulty processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous consensus and broadcast protocols
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• Byzantine Fault Detectors for Solving Consensus
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Random oracles in constantipole

This page was built for publication: Low complexity Byzantine-resilient consensus