Sciweavers

Share
SPAA
2010
ACM

Brief announcement: byzantine agreement with homonyms

9 years 1 days ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total number of processes n, in the presence of t < n Byzantine processes. We prove the following results: (i) agreement is possible if (and only if) l > 3t in a synchronous model; (ii) agreement is impossible, independently of the number of failures, in an eventually synchronous model; (iii) eventual agreement is possible, if (and only if) l > 3t, in an asynchronous model. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design—distributed networks; C.2.4 [Computer-Communication Networks]: Distributed Systems; C.4 [Performance of Systems]: [Fault tolerance] General Terms Algorithms, Theory, Reliability Keywords Consensus, Message-Passing, Byzantine Agreement, Authentication.
Carole Delporte-Gallet, Hugues Fauconnier, Rachid
Added 18 Jul 2010
Updated 18 Jul 2010
Type Conference
Year 2010
Where SPAA
Authors Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec
Comments (0)
books