An algorithm for the Byzantine Agreement without authentication in a set of n processes is presented. This algorithm has the peculiarity of being more efficient as less malicious the behaviour of the faulty processes is and less the number of actual faulty processes is. If the number of actually faulty processes is less of t/2 (t is the maximum allowable number of faulty processes) it is shown that the proposed algorithm converges very quickly to the agreement. In a system composed of 3t processes and one sender process, if at most Lt/2J+1 faulty processes are present (except the sender), reaching the agreement requires 3 rounds and 2(n-1) messages exchanged per process. A comparison with known algorithms based on similar hypotheses is performed.
A gracefully degradable algorithm for byzantine agreement
Grandoni F;
1986
Abstract
An algorithm for the Byzantine Agreement without authentication in a set of n processes is presented. This algorithm has the peculiarity of being more efficient as less malicious the behaviour of the faulty processes is and less the number of actual faulty processes is. If the number of actually faulty processes is less of t/2 (t is the maximum allowable number of faulty processes) it is shown that the proposed algorithm converges very quickly to the agreement. In a system composed of 3t processes and one sender process, if at most Lt/2J+1 faulty processes are present (except the sender), reaching the agreement requires 3 rounds and 2(n-1) messages exchanged per process. A comparison with known algorithms based on similar hypotheses is performed.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419810-doc_148523.pdf
accesso aperto
Descrizione: A gracefully degradable algorithm for byzantine agreement
Dimensione
2.54 MB
Formato
Adobe PDF
|
2.54 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
