-
Homonyms with forgeable identifiers
We consider here the Byzantine Agreement problem (BA) in synchronous systems with homonyms in the case where some identifiers may be forgeable. More precisely, the n... -
Byzantine agreement with homonyms
International audience -
On Byzantine Broadcast in Planar Graphs
We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes may exhibit... -
Parameterizable Byzantine Broadcast in Loosely Connected Networks
We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious... -
Limiting Byzantine Influence in Multihop Asynchronous Networks
International audience
