Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps

摘要

This paper investigates on the implementation of a self-stabilizing regular register emulated by n servers that is tolerant to both mobile Byzantine agents, and transient failures in a round-free synchronous model. Differently from existing Mobile Byzantine tolerant register implementation, this paper considers a more powerful adversary where (ⅰ) the message delay (i.e., δ) and the period of mobile Byzantine agents movement (i.e., Δ) are completely decoupled and (ⅱ) servers are not aware of their state i.e., they do not know if they have been corrupted or not by a mobile Byzantine agent. We claim the existence of an optimal protocol that tolerates (ⅰ) any number of transient failures, and (ⅱ) up to / Mobile Byzantine agents.