Asynchronous Byzantine reliable broadcast with a message adversary

DOI10.1016/j.tcs.2023.114110arXiv2205.09992OpenAlexW4280488393MaRDI QIDQ6050128

Timothé Albouy, François Taïani, Davide Frey, Michel Raynal

Publication date: 12 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.09992

zbMATH Keywords

asynchronous systemchurnreliable broadcastByzantine processesmessage-passingmessage lossesmessage adversarymessage signaturestransient disconnection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Synchronous consensus under hybrid process and link failures
• Asynchronous byzantine agreement protocols
• The Heard-Of model: computing in distributed systems with benign faults
• Agreement in synchronous networks with ubiquitous faults
• Distributed computation in dynamic networks
• Introduction to Reliable and Secure Distributed Programming
• Asynchronous consensus and broadcast protocols
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
• On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm
• Time is not a healer
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
• Fault-Tolerant Message-Passing Distributed Systems

This page was built for publication: Asynchronous Byzantine reliable broadcast with a message adversary