Learn More
We study the problem of Byzantine agreement in synchronous systems where malicious agents can move from one process to another and try to corrupt them. This model is known as mobile Byzantine faults. In a previous result [10], Garay has shown that n > 6t (n is the total number of processes, and t is the number of mobile faults) is sufficient to solve this(More)
  • 1