English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the following problem: two nodes want to reliably communicate ina dynamic multihop network where some nodes have been compromised, and may havea totally arbitrary and unpredictable behavior. These nodes are calledByzantine. We consider the two cases where cryptography is available and notavailable. We prove the necessary and sufficient condition (that is, theweakest possible condition) to ensure reliable communication in this context.Our proof is constructive, as we provide Byzantine-resilient algorithms forreliable communication that are optimal with respect to our impossibilityresults. In a second part, we investigate the impact of our conditions in threecase studies: participants interacting in a conference, robots moving on a gridand agents in the subway. Our simulations indicate a clear benefit of using ouralgorithms for reliable communication in those contexts.

Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults