N. Naoumov and K. W. Ross, Exploiting P2P systems for DDoS attacks, Proceedings of the 1st international conference on Scalable information systems , InfoScale '06, 2006.
DOI : 10.1145/1146847.1146894

A. Fiat, J. Saia, and M. Young, Making Chord Robust to Byzantine Attacks, Proceedings of the Annual European Symposium on Algorithms (AESA), 2005.
DOI : 10.1007/11561071_71

I. Baumgart and S. Mies, S/Kademlia: A practicable approach towards secure key-based routing, 2007 International Conference on Parallel and Distributed Systems, 2007.
DOI : 10.1109/ICPADS.2007.4447808

E. Anceaume, F. Brasileiro, R. Ludinard, and A. Ravoaja, PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008.
DOI : 10.1109/SASO.2008.44

B. Awerbuch and C. Scheideler, Towards scalable and robust overay networks, Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2007.

P. B. Godfrey, S. Shenker, and I. Stoica, Minimizing churn in distributed systems, Proceedings of the ACM SIGCOMM, 2006.

E. Anceaume, F. Brasileiro, R. Ludinard, B. Sericola, and F. Tronel, Analytical study of adversarial strategies in clusterbased overlays, Proceedings of the 2nd International Workshop on Reliability, Availability, and Security (WRAS), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00408871

M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, Secure routing for structured peer-to-peer overlay networks, Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI), 2002.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proceedings of the ACM SIGCOMM, 2001.

I. Stoica, D. Liben-nowell, R. Morris, D. Karger, F. Dabek et al., Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the ACM SIGCOMM, 2001.

P. Druschel and A. Rowstron, PAST: a large-scale, persistent peer-to-peer storage utility, Proceedings Eighth Workshop on Hot Topics in Operating Systems, 2001.
DOI : 10.1109/HOTOS.2001.990064

A. Singh, T. Ngan, P. Drushel, and D. Wallach, Eclipse Attacks on Overlay Networks: Threats and Defenses, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFOCOM.2006.231

E. Sit and R. Morris, Security Considerations for Peer-to-Peer Distributed Hash Tables, Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
DOI : 10.1007/3-540-45748-8_25

K. Hildrum and J. Kubiatowicz, Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks, Proceedings of theInternational Symposium on Distributed Computing, 2003.
DOI : 10.1007/978-3-540-39989-6_23

T. Condie, V. Kacholia, S. Sankararaman, J. M. Hellerstein, and P. Maniatis, Induced churn as shelter from routing-table poisoning Accessing nearby copies of replicated objects in a distributed environment, Procs of the 13th thirteenth Annual Symposium on Network and Distributed System Security (NDSS'06) Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1997.

P. Maymounkov and D. Mazieres, Kademlia: A Peer-to-Peer Information System Based on the XOR Metric, Proceedings for the International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
DOI : 10.1007/3-540-45748-8_5

T. Locher, S. Schmid, and R. Wattenhofer, eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006.
DOI : 10.1109/P2P.2006.17

J. Douceur, The Sybil Attack, Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
DOI : 10.1007/3-540-45748-8_24

R. Housley, W. Ford, W. Polk, and D. Solo, Internet x.509 public key infrastructure certificate and crl profile, 1999.
DOI : 10.17487/rfc2459

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

E. Anceaume, R. Ludinard, B. Sericola, and F. Tronel, Performance analysis of large scale peer-to-peer overlays using markov chains, IRISA, 1963.
URL : https://hal.archives-ouvertes.fr/inria-00546039

B. Sericola, Closed-form solution for the distribution of the total time spent in a subset of states of a homogeneous Markov process during a finite observation period, Journal of Applied Probability, vol.35, issue.03, pp.713-719, 1990.
DOI : 10.1017/S0021900200039255
URL : https://hal.archives-ouvertes.fr/inria-00075653

B. Sericola and G. Rubino, Sojourn times in Markov processes, Journal of Applied Probability, vol.26, issue.4, pp.744-756, 1989.
URL : https://hal.archives-ouvertes.fr/inria-00075739

E. Anceaume, F. Castella, R. Ludinard, and B. Sericola, Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems, Methodology and Computing in Applied Probability, vol.15, issue.2, 2011.
DOI : 10.1007/s11009-011-9239-6
URL : https://hal.archives-ouvertes.fr/inria-00485667