555 citations · 1k across the 61 of their papers we have counts for
34 papers · 1 filter
Strong Byzantine Agreement with Adaptive Word Complexity
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The strong Byzantine agreement (SBA) problem is defined among n processes, out of which t < n can be faulty and behave arbitrarily. SBA allows correct (non-faulty) processes to agr…
On the Inherent Anonymity of Gossiping
Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko +2
Detecting the source of a gossip is a critical issue, related to identifying patient zero in an epidemic, or the origin of a rumor in a social network. Although it is widely acknow…
Every Bit Counts in Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +3
Consensus enables n processes to agree on a common valid L-bit value, despite t < n/3 processes being faulty and acting arbitrarily. A long line of work has been dedicated to impro…
Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search
Andrei Kucharavy, Matteo Monti, Rachid Guerraoui +1
Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms…
Chop Chop: Byzantine Atomic Broadcast to the Network Limit
Martina Camaioni, Rachid Guerraoui, Matteo Monti +3
At the heart of state machine replication, the celebrated technique enabling decentralized and secure universal computation, lies Atomic Broadcast, a fundamental communication prim…
On the Validity of Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The Byzantine consensus problem involves processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiri…