Practically stabilizing SWMR atomic memory in message-passing systems, Journal of Computer and System Sciences, vol.81, issue.4, pp.692-701, 2015. ,
DOI : 10.1016/j.jcss.2014.11.014
URL : https://hal.archives-ouvertes.fr/hal-01123697
An improved byzantine agreement algorithm for synchronous systems with mobile faults, International Journal of Computer Applications, vol.43, issue.22, pp.1-7, 2012. ,
Synchronous byzantine quorum systems, Distributed Computing, vol.13, issue.1, pp.45-52, 2000. ,
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
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/2767386.2767453
URL : https://hal.archives-ouvertes.fr/hal-01340261
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, 2015. ,
DOI : 10.1007/BFb0028994
URL : https://hal.archives-ouvertes.fr/hal-01340273
Byzantine tolerant storage, Proceedings of the International Conference on Parallel and Distributed Processing Systems (IEEE IPDPS 2015), 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01206290
Optimal Mobile Byzantine Fault Tolerant Distributed Storage, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, 2016. ,
DOI : 10.1145/98163.98167
URL : https://hal.archives-ouvertes.fr/hal-01349064
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
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
On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986. ,
DOI : 10.1007/3-540-10235-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038
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=10.1.1.113.7381
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=10.1.1.12.6445
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=10.1.1.11.7793
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
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
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
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
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=10.1.1.150.5765