Towards Efficient and Robust BFT Protocols - Archive ouverte HAL
Communication Dans Un Congrès Année : 2016

Towards Efficient and Robust BFT Protocols

Lucas Perronne
  • Fonction : Auteur
  • PersonId : 778002
  • IdRef : 22337394X

Résumé

Byzantine Fault Tolerant (BFT) protocols rely on state machine replication to handle arbitrary behaviors. Significant efforts have been recently made to strengthen these protocols in order to minimize the performance degradation in presence of faulty components. In this paper, we focus on the potential damages that could be introduced from the client side of such protocols. In order to deal with this specific kind of threats, BFT protocols rely on request authentication to provide access control. Nevertheless, byzantine clients may benefit from the weakness of the underlying authentications mechanisms in order to tamper with the performance of replicated systems. We describe the main reliability issues that can be introduced by faulty clients in current BFT protocols, and we argue against the systematic usage of digital signatures. Finally, we propose a new policy in order to avoid the overhead due to systematic signatures verifications.
Fichier principal
Vignette du fichier
Towards Efficient and Robust BFT Protocols.pdf (96.82 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01316523 , version 1 (17-05-2016)

Identifiants

  • HAL Id : hal-01316523 , version 1

Citer

Lucas Perronne, Sara Bouchenak. Towards Efficient and Robust BFT Protocols. Fast Abstract in the 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Jun 2016, Toulouse, France. ⟨hal-01316523⟩
214 Consultations
283 Téléchargements

Partager

More