Approximate Agreement under Mobile Byzantine Faults

This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.

[1]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Xavier Défago,et al.  Tight Bound on Mobile Byzantine Agreement , 2014, DISC.

[3]  Lewis Tseng,et al.  Iterative Approximate Byzantine Consensus under a Generalized Fault Model , 2012, ICDCN.

[4]  Nitin H. Vaidya,et al.  Reaching approximate Byzantine consensus with multi-hop communication , 2014, Inf. Comput..

[5]  Maurice Herlihy,et al.  Multidimensional approximate agreement in Byzantine asynchronous systems , 2013, STOC '13.

[6]  Moti Yung,et al.  The "Mobile Adversary" Paradigm in Distributed Computation and Systems , 2015, PODC.

[7]  Maria Gradinariu Potop-Butucaru,et al.  Optimal Byzantine-resilient convergence in uni-dimensional robot networks , 2010, Theor. Comput. Sci..

[8]  Maurice Herlihy,et al.  Multidimensional agreement in Byzantine systems , 2014, Distributed Computing.

[9]  P. Gács,et al.  Algorithms , 1992 .

[10]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  Taisuke Izumi,et al.  An Improved Byzantine Agreement Algorithm forSynchronous Systems with Mobile Faults , 2012 .

[12]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[13]  Yukiko Yamauchi,et al.  Mobile Byzantine Agreement on Arbitrary Network , 2013, OPODIS.

[14]  Juan A. Garay,et al.  Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract) , 1994, WDAG.

[15]  Paul G. Spirakis,et al.  Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing , 2015, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[16]  Lewis Tseng,et al.  Asynchronous convex hull consensus in the presence of crash faults , 2014, PODC '14.

[17]  Yun Wang,et al.  Approximate Byzantine consensus in sparse, mobile ad-hoc networks , 2014, J. Parallel Distributed Comput..

[18]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[19]  Rafail Ostrovsky,et al.  How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.

[20]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[21]  Maria Gradinariu Potop-Butucaru,et al.  Byzantine Convergence in Robot Networks: The Price of Asynchrony , 2009, OPODIS.

[22]  Alan Fekete.  Asynchronous approximate agreement , 1987, PODC '87.

[23]  Alan Fekete,et al.  Asymptotically optimal algorithms for approximate agreement , 1986, PODC '86.

[24]  Rüdiger Reischuk,et al.  A New Solution for the Byzantine Generals Problem , 1985, Inf. Control..

[25]  Matthias Függer,et al.  Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms , 2014, ICALP.

[26]  Piotr Berman,et al.  Towards Optimal Distributed Consensus (Extended Abstract) , 1989, FOCS 1989.

[27]  Jaap-Henk Hoepman,et al.  Optimal resiliency against mobile faults , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[28]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[29]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[30]  Roger Wattenhofer,et al.  Byzantine Agreement with Median Validity , 2015, OPODIS.

[31]  Lewis Tseng,et al.  Iterative Approximate Consensus in the Presence of Byzantine Link Failures , 2014, NETYS.