Consensus on an unknown torus with dense byzantine faults
We present a solution to consensus on a torus with Byzantine faults. Any solution to classic
consensus that is tolerant to f Byzantine faults requires 2 f+ 1 node-disjoint paths. Due to …
consensus that is tolerant to f Byzantine faults requires 2 f+ 1 node-disjoint paths. Due to …
BeRGeR: Byzantine-Robust Geometric Routing
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees
delivery of a message despite a Byzantine fault without relying on cryptographic primitives or …
delivery of a message despite a Byzantine fault without relying on cryptographic primitives or …