8 citations · 30 across the 31 of their papers we have counts for
3 papers · 1 filter
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…
Self-stabilizing Byzantine Multivalued Consensus
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Cons…
Self-stabilizing Byzantine-tolerant Recycling
Chryssis Georgiou, Michel Raynal, Elad M. Schiller
Numerous distributed applications, such as cloud computing and distributed ledgers, necessitate the system to invoke asynchronous consensus objects an unbounded number of times, wh…