B. Les, Enfin, nous avons généralisé des résultats existants aux réseaux dynamiques et aux réseaux de taille non-bornée

F. Cristian, Understanding fault-tolerant distributed systems, Communications of the ACM, vol.34, issue.2, pp.56-78, 1991.
DOI : 10.1145/102792.102801

P. A. Santeler, K. A. Jansen, and S. P. Olarig, Fault tolerant memory, p.301, 2001.

L. Lamport, R. E. Shostak, and M. C. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

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

G. Tel, Introduction to Distributed Algorithms, 2000.
DOI : 10.1017/CBO9781139168724

URL : http://dx.doi.org/10.1016/s0898-1221(97)90063-8

N. Santoro, Design and Analysis of Distributed Algorithms, 2007.
DOI : 10.1002/0470072644

M. Raynal, Distributed Algorithms for Message-Passing Systems, 2013.
DOI : 10.1007/978-3-642-38123-2

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

M. Castro and B. Liskov, Practical byzantine fault tolerance, OSDI, pp.173-186, 1999.

R. Vadim-drabkin, M. Friedman, and . Segal, Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks, 2005 International Conference on Dependable Systems and Networks (DSN'05), pp.160-169, 2005.
DOI : 10.1109/DSN.2005.42

C. Cachin, K. Kursawe, and V. Shoup, Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography, Journal of Cryptology, vol.18, issue.3, pp.219-246, 1982.
DOI : 10.1007/s00145-005-0318-0

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

R. Perlman, Network layer protocols with byzantine robustness. CSAIL Publications and Digital Archive, 1989.

N. Ristanovic, P. Papadimitratos, G. Theodorakopoulos, J. Hubaux, and J. Boudec, Adaptive Message Authentication for multi-hop networks, 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services, 2011.
DOI : 10.1109/WONS.2011.5720206

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

J. Talbot and D. Welsh, Complexity and Cryptography: An Introduction
DOI : 10.1017/CBO9780511755286

L. Peter-alan and T. Anderson, Wireless sensor networks: a survey, Computer Networks, vol.38, issue.4, pp.393-422, 2002.

G. De-meulenaer, F. Gosset, O. Standaert, and O. Pereira, On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2008.
DOI : 10.1109/WiMob.2008.16

G. T. Sibley, M. H. Rahimi, and G. Sukhatme, Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), 2002.
DOI : 10.1109/ROBOT.2002.1014697

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

R. Lippmann, K. Ingols, C. Scott, and K. Piwowarski, Validating and Restoring Defense in Depth Using Attack Graphs, MILCOM 2006, 2006.
DOI : 10.1109/MILCOM.2006.302434

H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 1998.
DOI : 10.1002/0471478210

D. Malkhi, Y. Mansour, and M. K. Reiter, Diffusion without false rumors: on propagating updates in a Byzantine environment, Theoretical Computer Science, vol.299, issue.1-3, pp.289-306, 2003.
DOI : 10.1016/S0304-3975(02)00325-0

D. Malkhi, M. Reiter, O. Rodeh, and Y. Sella, Efficient update diffusion in byzantine environments, Proceedings 20th IEEE Symposium on Reliable Distributed Systems, pp.90-98, 2001.
DOI : 10.1109/RELDIS.2001.969758

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

Y. Minsky and F. B. Schneider, Tolerating malicious gossip, Distributed Computing, pp.49-68, 2003.
DOI : 10.1007/s00446-002-0082-4

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

T. Masuzawa and S. Tixeuil, Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults, International Journal of Principles and Applications of Information Science and Technology (PAIST), vol.1, issue.1, pp.1-13, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01152556

M. Nesterenko and A. Arora, Tolerance to unbounded Byzantine faults, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.22-29, 2002.
DOI : 10.1109/RELDIS.2002.1180170

Y. Sakurai, F. Ooshita, and T. Masuzawa, A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks, Principles of Distributed Systems, 8th International Conference, pp.283-298, 2004.
DOI : 10.1007/11516798_21

T. Masuzawa and S. Tixeuil, Bounding the Impact of Unbounded Attacks in Stabilization, SSS, pp.440-453, 2006.
DOI : 10.1007/978-3-540-49823-0_31

URL : https://hal.archives-ouvertes.fr/inria-00484645

S. Dubois, T. Masuzawa, and S. Tixeuil, Maximum Metric Spanning Tree Made Byzantine Tolerant, Proceedings of DISC 2011, 2011.
DOI : 10.1016/0020-0190(92)90264-V

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

S. Dubois, T. Masuzawa, and S. Tixeuil, Bounding the Impact of Unbounded Attacks in Stabilization, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.3, 2011.
DOI : 10.1109/TPDS.2011.158

URL : https://hal.archives-ouvertes.fr/inria-00484645

S. Dubois, T. Masuzawa, and S. Tixeuil, On Byzantine Containment Properties of the min???+???1 Protocol, Proceedings of SSS 2010, 2010.
DOI : 10.1007/978-3-642-16023-3_10

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

S. Berlin and /. Heidelberg, URL http://hal.inria.fr/inria-00487091

S. Dubois, T. Masuzawa, and S. Tixeuil, The Impact of Topology on Byzantine Containment in Stabilization, Proceedings of DISC 2010, 2010.
DOI : 10.1007/978-3-642-15763-9_47

URL : https://hal.archives-ouvertes.fr/inria-00481836

C. Koo, Broadcast in radio networks tolerating byzantine adversarial behavior, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.275-282, 2004.
DOI : 10.1145/1011767.1011807

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

V. Bhandari and N. H. Vaidya, On reliable broadcast in a radio network, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05
DOI : 10.1145/1073814.1073841

A. Pelc and D. Peleg, Broadcasting with locally bounded Byzantine faults, Information Processing Letters, vol.93, issue.3
DOI : 10.1016/j.ipl.2004.10.007

C. Litsas, A. Pagourtzis, G. Panagiotakos, and D. Sakavalas, On the resilience and uniqueness of CPA for secure broadcast

D. Dolev, The Byzantine generals strike again, Journal of Algorithms, vol.3, issue.1, pp.14-30, 1982.
DOI : 10.1016/0196-6774(82)90004-9

M. Nesterenko and S. Tixeuil, Discovering Network Topology in the Presence of Byzantine Faults, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.12, pp.1777-1789, 2009.
DOI : 10.1109/TPDS.2009.25

T. Böhme, F. Göring, and J. Harant, Menger's Theorem, Journal of Graph Theory, vol.8, issue.1, pp.35-36, 2001.
DOI : 10.1002/jgt.1001

I. T. Foster, C. Kesselman, and S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, IJHPCA, vol.15, issue.3, pp.200-222, 2001.

A. Maurer and S. Tixeuil, Confinement de fautes byzantines dans les réseaux multi-sauts asynchrones, 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012.

A. Maurer and S. Tixeuil, Limiting Byzantine Influence in Multihop Asynchronous Networks, 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp.183-192, 2012.
DOI : 10.1109/ICDCS.2012.15

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

A. Maurer and S. Tixeuil, Containing Byzantine Failures with Control Zones, IEEE Transactions on Parallel and Distributed Systems, 2014.
DOI : 10.1109/TPDS.2014.2308190

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

A. Maurer and S. Tixeuil, On Byzantine Broadcast in Loosely Connected Networks, Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012, pp.183-192, 2012.
DOI : 10.1007/978-3-642-33651-5_18

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

A. Maurer and S. Tixeuil, Byzantine broadcast with fixed disjoint paths, Journal of Parallel and Distributed Computing, vol.74, issue.11, 2014.
DOI : 10.1016/j.jpdc.2014.07.010

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

A. Maurer and S. Tixeuil, Self-Stabilizing Byzantine Broadcast, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, 2014.
DOI : 10.1109/SRDS.2014.10

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

A. Maurer and S. Tixeuil, Tolérer les fautes byzantines dans les graphes planaires, 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2013.

D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and Inference Problems for Temporal Networks, Journal of Computer and System Sciences, vol.64, issue.4, pp.820-842, 2002.
DOI : 10.1006/jcss.2002.1829

URL : http://doi.org/10.1006/jcss.2002.1829

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Impact of human mobility on opportunistic forwarding algorithms, TMC, vol.6, issue.6, pp.606-620, 2007.

A. Maurer and S. Tixeuil, A Scalable Byzantine Grid, Proceedings of the 14th International Conference on Distributed Computing and Networking, pp.87-101
DOI : 10.1007/978-3-642-35668-1_7

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

K. Donat and . Kazarinoff, On wallis formula, Edinburgh Mathematical Notes, pp.19-21, 1956.