On Byzantine Agreement over (2, 3)-Uniform Hypergraphs

@inproceedings{Ravikant2004OnBA,
  title={On Byzantine Agreement over (2, 3)-Uniform Hypergraphs},
  author={D. V. S. Ravikant and Muthuramakrishnan Venkitasubramaniam and V. Srikanth and K. Srinathan and C. Pandu Rangan},
  booktitle={DISC},
  year={2004}
}
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; after exchanging messages, all correct processes must agree on one of the initial values of the non-faulty processes. If the network consists of only unicast channels (i.e. a 2-uniform hypergraph), then Byzantine agreement is possible if and only if n ≥ 3t + 1 (Pease et. al. [11]). However, Fitzi and Maurer ([7]) show… CONTINUE READING