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. © 2012 Springer-Verlag.
CITATION STYLE
Delporte-Gallet, C., Fauconnier, H., & Tran-The, H. (2012). Homonyms with forgeable identifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7355 LNCS, pp. 171–182). https://doi.org/10.1007/978-3-642-31104-8_15
Mendeley helps you to discover research relevant for your work.