Corpus ID: 6981656

An Improved Byzantine Agreement Algorithm forSynchronous Systems with Mobile Faults

@article{Banu2012AnIB,
  title={An Improved Byzantine Agreement Algorithm forSynchronous Systems with Mobile Faults},
  author={N. Banu and S. Souissi and T. Izumi},
  journal={International Journal of Computer Applications},
  year={2012},
  volume={43},
  pages={1-7}
}
  • N. Banu, S. Souissi, T. Izumi
  • Published 2012
  • Computer Science
  • International Journal of Computer Applications
  • 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 problem even in the presence of strong agents. These agents can move at full speed (in the sense that each agent can take a movement in every… CONTINUE READING
    19 Citations

    Topics from this paper

    Tight bound on mobile Byzantine Agreement
    • 1
    • Highly Influenced
    Tight Bound on Mobile Byzantine Agreement
    • 21
    • Highly Influenced
    • PDF
    Title Tight Bound on Mobile Byzantine Agreement
    • Highly Influenced
    • PDF
    Optimal Mobile Byzantine Fault Tolerant Distributed Storage
    • 5
    • Highly Influenced
    • PDF
    Optimal Storage under Unsynchronized Mobile Byzantine Faults
    • 2
    • Highly Influenced
    • PDF
    Tight self-stabilizing mobile byzantine-tolerant atomic register
    • 6
    • PDF
    Byzantine Agreement with Unknown Participants and Failures
    • PDF

    References

    SHOWING 1-10 OF 48 REFERENCES
    Optimal resiliency against mobile faults
    • 24
    • PDF
    Interactive consistency with multiple failure modes
    • 219
    From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
    • 118
    • PDF
    Practical byzantine fault tolerance and proactive recovery
    • 1,607
    • PDF
    Separating agreement from execution for byzantine fault tolerant services
    • 326
    • PDF
    A New Solution for the Byzantine Generals Problem
    • R. Reischuk
    • Computer Science, Mathematics
    • Inf. Control.
    • 1985
    • 74
    Unreliable failure detectors for reliable distributed systems
    • 2,778
    • PDF
    Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)
    • 39
    • Highly Influential