A hybrid protocol to solve authenticated Byzantine consensus

DOI10.3233/FI-2020-1916zbMATH Open1471.68034OpenAlexW3006496270MaRDI QIDQ5134271FDOQ5134271

Authors: Abdelhamid Tioura, Hamouma Moumen, Hamoudi Kalla, Saidi Ahmed Ait 

Publication date: 16 November 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2020-1916

Recommendations

• Consensus in Byzantine asynchronous systems
• Minimal synchrony for Byzantine consensus
• Asynchronous byzantine agreement protocols
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• Byzantine Fault Detectors for Solving Consensus

zbMATH Keywords

consensusdistributed algorithmsfault toleranceasynchronous distributed systemsByzantine processhybrid protocoltime-free assumptiontimer-based assumption

Mathematics Subject Classification ID

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

Cited In (7)

• On the composition of authenticated Byzantine Agreement
• Byzantine Agreement Using Partial Authentication
• A New Solution to Detectable Byzantine Agreement Problem
• Low complexity Byzantine-resilient consensus
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new solution for the Byzantine agreement problem

This page was built for publication: A hybrid protocol to solve authenticated Byzantine consensus

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