E. Anceaume, F. Brasiliero, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6020

G. Bracha, An asynchronous [(n - 1)/3]-resilient consensus protocol, Proceedings of the third annual ACM symposium on Principles of distributed computing , PODC '84, 1984.
DOI : 10.1145/800222.806743

M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, Secure routing for structured peer-to-peer overlay networks, Proc. of the Symposium on Operating Systems Design and Implementation (OSDI), 2002.
DOI : 10.1145/844128.844156
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.1870

M. Correia, N. Ferreira-neves, and P. Verissimo, From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures, The Computer Journal, vol.49, issue.1, 2006.
DOI : 10.1093/comjnl/bxh145

D. Dolev, E. Hoch, and R. Van-renesse, Self-stabilizing and Byzantine-Tolerant Overlay Network, Proc. of the Int'l Conference On Principles Of Distributed Systems (OPODIS), 2007.
DOI : 10.1007/978-3-540-77096-1_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8694

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

A. Fiat, J. Saia, and M. Young, Making Chord Robust to Byzantine Attacks, Proc. of the Annual European Symposium on Algorithms (ESA), 2005.
DOI : 10.1007/11561071_71
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.3617

J. A. Garay and Y. Moses, Fully polynomial byzantine agreement for n > 3t processes in t + 1 rounds, SIAM Journal on Computing, vol.27, issue.1, 1998.

K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao, Distributed data location in a dynamic network, Proc. for the ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2002.

K. Hildrum and J. Kubiatowicz, Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks, Proc. of the Int'l Symposium on Distributed Computing, 2003.
DOI : 10.1007/978-3-540-39989-6_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.5823

J. Li, J. Stribling, T. Gil, R. Morris, and F. Kaashoek, Comparing the Performance of Distributed Hash Tables Under Churn, Proc. for the Int'l Workshop on Peer-to-Peer Systems (IPTPS), 2004.
DOI : 10.1007/978-3-540-30183-7_9

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6826

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

H. Ramasamy and C. Cachin, Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast, Proc. of the Int'l Conference On Principles Of Distributed Systems (OPODIS), 2005.
DOI : 10.1007/3-540-45539-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.1511

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable contentaddressable network, Proc. of the ACM SIGCOMM, 2001.

A. Ravoaja and E. Anceaume, STORM: A Secure Overlay for P2P Reputation Management, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)
DOI : 10.1109/SASO.2007.57
URL : https://hal.archives-ouvertes.fr/hal-00916751

R. Rivest, The md5 message digest algorithm, 1992.
DOI : 10.17487/rfc1321

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proc. of the Int'l Conference on Distributed Systems Platforms (Middleware), 2001.
DOI : 10.1007/3-540-45518-3_18

Y. Saad and M. Schultz, Topological properties of hypercubes, IEEE Transactions on Computers, vol.37, issue.7, 1988.
DOI : 10.1109/12.2234

C. Scheideler, Robust random number generation for peer-to-peer systems, Proc. of the Int'l Conference On Principles Of Distributed Systems (OPODIS). LNCS 4305, 2006.

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

M. Srivatsa and L. Liu, Vulnerabilities and security threats in structured peer-topeer systems: A quantitiative analysis, Proc. of the Annual Computer Security Applications Conference (ACSAC), 2004.

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

A. C. Yao, Probabilistic computations: Toward a unified measure of complexity, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977.
DOI : 10.1109/SFCS.1977.24