Multi-hop Byzantine Reliable Broadcast Made Practical - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Rapport (Rapport Technique) Année : 2019

Multi-hop Byzantine Reliable Broadcast Made Practical

Résumé

We revisit Byzantine tolerant reliable broadcast algorithms in multi-hop networks. To tolerate up to f Byzantine nodes, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g. digital signatures are not available). We propose optimizations that preserve the safety and liveness properties of the original unauthenticated protocols, while highly decreasing their observed message complexity when simulated on several classes of graph topologies.
Fichier principal
Vignette du fichier
main.pdf (4.6 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01826865 , version 1 (29-06-2018)
hal-01826865 , version 2 (21-03-2019)
hal-01826865 , version 3 (04-09-2019)

Identifiants

Citer

Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil. Multi-hop Byzantine Reliable Broadcast Made Practical. [Technical Report] Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6, LIP6, F-75005 Paris, France; Dipartimento di Ingegneria Informatica Automatica e Gestionale "Antonio Ruberti'', Sapienza Università di Roma, Rome, Italy. 2019. ⟨hal-01826865v2⟩
255 Consultations
164 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More