Location of Repository

Byzantine agreement with homonyms in synchronous systems

By Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The


International audienceWe consider here the Byzantine agreement problem in synchronous systems with homonyms. In this model different processes may have the same authenticated identifier. In such a system of n processes sharing a set of l identifiers, we define a distribution of the identifiers as an integer partition of n into l parts n1,...,nl giving for each identifier i the number of processes having this identifier. Assuming that the processes know the distribution of identifiers we give a necessary and sufficient condition on the integer partition of n to solve the Byzantine agreement with at most t Byzantine processes. Moreover we prove that there exists a distribution of l identifiers enabling to solve Byzantine agreement with at most t Byzantine processes if and only if n>3t, l>t and View the MathML source where r=nmodl. This bound is to be compared with the l>3t bound proved in Delporte-Gallet et al. (2011) [4] when the processes do not know the distribution of identifiers

Publisher: Elsevier
Year: 2013
DOI identifier: 10.1016/j.tcs.2012.11.012
OAI identifier: oai:HAL:hal-00922415v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.inria.fr/hal-00922... (external link)
  • https://hal.inria.fr/hal-00922... (external link)
  • https://hal.inria.fr/hal-00922... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.