9 papers
From Bracha to Coded MBRB: Benchmarking Byzantine Reliable Broadcast Implementations
Yenan Wang, Jesper Kullberg, Fabian Paglianno Persson +2
Byzantine Reliable Broadcast (BRB) and Message-Adversary-Tolerant Byzantine Reliable Broadcast (MBRB) are reliable-dissemination abstractions for fault-tolerant distributed systems…
On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +2
This paper studies the decidability of task problems, i.e., distributed problems expressed as sets of distributed tasks. Specifically, we introduce a new class of task problems cal…
Tight Conditions for Binary-Output Tasks under Crashes
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +2
This paper explores necessary and sufficient system conditions to solve distributed tasks with binary outputs (\textit{i.e.}, tasks with output values in ). We focus on th…
Asynchronous BFT Asset Transfer: Quasi-Anonymous, Light, and Consensus-Free
Timothé Albouy, Emmanuelle Anceaume, Davide Frey +4
This paper introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freed…
AMECOS: A Modular Event-based Framework for Concurrent Object Specification
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +3
In this work, we introduce a modular framework for specifying distributed systems that we call AMECOS. Specifically, our framework departs from the traditional use of sequential sp…
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
Timothé Albouy, Davide Frey, Ran Gelles +5
We address the problem of Reliable Broadcast in asynchronous message-passing systems with nodes, of which up to are malicious (faulty), in addition to a message adversary t…
Context Adaptive Cooperation
Timothé Albouy, Davide Frey, Mathieu Gestin +2
As shown by Reliable Broadcast and Consensus, cooperation among a set of independent computing entities (sequential processes) is a central issue in distributed computing. Consider…
Asynchronous Byzantine Reliable Broadcast With a Message Adversary
Timothé Albouy, Davide Frey, Michel Raynal +1
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behav…
A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary
Timothé Albouy, Davide Frey, Michel Raynal +1
This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, w…