N. Banu, S. Souissi, T. Izumi, and K. Wada, An improved byzantine agreement algorithm for synchronous systems with mobile faults, International Journal of Computer Applications, issue.22, pp.431-438, 2012.

A. Rida and . Bazzi, Synchronous byzantine quorum systems, Distributed Computing, vol.13, issue.1, pp.45-52, 2000.

F. Bonnet, X. Défago, T. Dang-nguyen, and M. Potop-butucaru, Tight bound on mobile byzantine agreement, Distributed Computing -28th International Symposium , DISC 2014 Proceedings, pp.76-90, 2014.
DOI : 10.1007/978-3-662-45174-8_6

URL : https://hal.archives-ouvertes.fr/hal-01340236

S. Bonomi, A. D. Pozzo, and M. Potop-butucaru, Tight self-stabilizing mobile byzantine-tolerant atomic register, Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN '16, pp.1-6, 2016.
DOI : 10.1145/2833312.2833320

URL : https://hal.archives-ouvertes.fr/hal-01340261

H. Buhrman, J. A. Garay, and J. Hoepman, Optimal resiliency against mobile faults, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers, pp.83-88, 1995.
DOI : 10.1109/FTCS.1995.466995

J. A. Garay, Reaching (and maintaining) agreement in the presence of mobile faults, Proceedings of the 8th International Workshop on Distributed Algorithms, pp.253-264, 1994.
DOI : 10.1007/BFb0020438

L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986.
DOI : 10.1007/BF01786227

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Malkhi and M. Reiter, Byzantine quorum systems, Distributed Computing, vol.11, issue.4, pp.203-213, 1998.
DOI : 10.1007/s004460050050

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Martin, L. Alvisi, and M. Dahlin, Minimal Byzantine Storage, Proceedings of the 16th International Conference on Distributed Computing, DISC '02, pp.311-325, 2002.
DOI : 10.1007/3-540-36108-1_21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Martin, L. Alvisi, and M. Dahlin, Small byzantine quorum systems, Proceedings International Conference on Dependable Systems and Networks, pp.374-383, 2002.
DOI : 10.1109/DSN.2002.1028922

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Ostrovsky and M. Yung, How to withstand mobile virus attacks (extended abstract), Proceedings of the tenth annual ACM symposium on Principles of distributed computing , PODC '91, pp.51-59, 1991.
DOI : 10.1145/112600.112605

R. Reischuk, A new solution for the Byzantine generals problem, Information and Control, vol.64, issue.1-3, pp.23-42, 1985.
DOI : 10.1016/S0019-9958(85)80042-5

T. Sasaki, Y. Yamauchi, S. Kijima, and M. Yamashita, Mobile Byzantine Agreement on Arbitrary Network, Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS'13), pp.236-250, 2013.
DOI : 10.1007/978-3-319-03850-6_17

F. B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol.22, issue.4, pp.299-319, 1990.
DOI : 10.1145/98163.98167

P. Sousa, A. Neves-bessani, M. Correia, N. Ferreira-neves, and P. Verissimo, Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.4, pp.452-465, 2009.
DOI : 10.1109/TPDS.2009.83

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=