2016/09/09 by Silvia Bonomi, Bonomi, Silvia, Antonella Del Pozzo +5
Computer Science · #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1609.02694
openalex publication_date 2016/09/09 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
This paper proposes the first 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 implementations, this paper considers a more powerful adversary where (i) the message delay (i.e., δ) and the period of mobile Byzantine agents movement (i.e., Δ) are completely decoupled and (ii) 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.The proposed protocol tolerates (i) any number of transient failures, and (ii) up to f Mobile Byzantine agents. In addition, our implementation uses bounded timestamps from the Z_13 domain and it is optimal with respect to the number of servers needed to tolerate f mobile Byzantine agents in the given model.