Homonyms with forgeable identifiers - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2012

Homonyms with forgeable identifiers

Résumé

We consider here the Byzantine Agreement problem (BA) in synchronous systems with homonyms in the case where some identifiers may be forgeable. More precisely, the n processes share a set of l (1<= l <= n) identifiers. Assuming that at most t processes may be Byzantine and at most k (t <=k <=l) of these identifiers are forgeable in the sense that any Byzantine process can falsely use them, we prove that Byzantine Agreement problem is solvable if and only if l> 2t +k. Moreover we extend this result to systems with authentication by signatures in which at most k signatures are forgeable and we prove that Byzantine Agreement problem is solvable if and only if l>t+k.

Domaines

Informatique
Fichier principal
Vignette du fichier
main.pdf (115.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00687836 , version 1 (16-04-2012)

Identifiants

  • HAL Id : hal-00687836 , version 1

Citer

Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The. Homonyms with forgeable identifiers. 2012. ⟨hal-00687836⟩
120 Consultations
224 Téléchargements

Partager

Gmail Facebook X LinkedIn More