Byzantine Geoconsensus

10/06/2020
by   Joseph Oglio, et al.
0

We define and investigate the consensus problem for a set of N processes embedded on the d-dimensional plane, d≥ 2, which we call the geoconsensus problem. The processes have unique coordinates and can communicate with each other through oral messages. In contrast to the literature where processes are individually considered Byzantine, it is considered that all processes covered by a finite-size convex fault area F are Byzantine and there may be one or more processes in a fault area. Similarly as in the literature where correct processes do not know which processes are Byzantine, it is assumed that the fault area location is not known to the correct processes. We prove that the geoconsensus is impossible if all processes may be covered by at most three areas where one is a fault area. Considering the 2-dimensional embedding, on the constructive side, for M ≥ 1 fault areas F of arbitrary shape with diameter D, we present a consensus algorithm that tolerates f≤ N-(2M+1) Byzantine processes provided that there are 9M+3 processes with pairwise distance between them greater than D. For square F with side ℓ, we provide a consensus algorithm that lifts this pairwise distance requirement and tolerates f≤ N-15M Byzantine processes given that all processes are covered by at least 22M axis aligned squares of the same size as F. For a circular F of diameter ℓ, this algorithm tolerates f≤ N-57M Byzantine processes if all processes are covered by at least 85M circles. We then extend these results to various size combinations of fault and non-fault areas as well as d-dimensional process embeddings, d≥ 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2021

Revisiting Optimal Resilience of Fast Byzantine Consensus

It is a common belief that Byzantine fault-tolerant solutions for consen...
research
02/08/2020

On Probabilistic Byzantine Fault Tolerance

Byzantine fault tolerance (BFT) has been extensively studied in distribu...
research
03/22/2023

Consensus on Unknown Torus with Dense Byzantine Faults

We present a solution to consensus on a torus with Byzantine faults. Any...
research
11/30/2020

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

Threshold guards are a basic primitive of many fault-tolerant algorithms...
research
02/21/2019

Rationals vs Byzantines in Consensus-based Blockchains

In this paper we analyze from the game theory point of view Byzantine Fa...
research
05/21/2021

Classifying Trusted Hardware via Unidirectional Communication

It is well known that Byzantine fault tolerant (BFT) consensus cannot be...
research
10/10/2020

Relay Protocol for Approximate Byzantine Consensus

This paper presents a novel algorithm for Approximate Byzantine Consensu...

Please sign up or login with your details

Forgot password? Click here to reset