Brief announcement: byzantine agreement with homonyms

@inproceedings{DelporteGallet2010BriefAB,
  title={Brief announcement: byzantine agreement with homonyms},
  author={Carole Delporte-Gallet and H. Fauconnier and R. Guerraoui and A. Kermarrec},
  booktitle={SPAA '10},
  year={2010}
}
  • Carole Delporte-Gallet, H. Fauconnier, +1 author A. Kermarrec
  • Published in SPAA '10 2010
  • Computer Science
  • 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… CONTINUE READING
    3 Citations

    Topics from this paper.