K. Aberer, L. O. Alima, A. Ghodsi, S. Girdzijauskas, S. Haridi et al., The Essence of P2P: A Reference Architecture for Overlay Networks, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), pp.11-20, 2005.
DOI : 10.1109/P2P.2005.38

M. K. Aguilera, R. Janakiraman, and L. Xu, Using Erasure Codes Efficiently for Storage in a Distributed System, 2005 International Conference on Dependable Systems and Networks (DSN'05), pp.336-345, 2005.
DOI : 10.1109/DSN.2005.96

E. Alchieri, A. Bessani, J. Da-silva-fraga, and F. Greve, Byzantine Consensus with Unknown Participants, Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS), pp.22-40, 2008.
DOI : 10.1109/TDSC.2006.35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.906

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, pp.15-24, 2008.
DOI : 10.1109/SASO.2008.44

I. Ari, B. Hong, E. L. Miller, S. A. Brandt, and D. D. Long, Modeling, analysis and simulation of flash crowds on the Internet, 2004.

B. Awerbuch and C. Scheideler, Towards a scalable and robust DHT, Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.318-327, 2006.

O. Baldellon, A. Mostéfaoui, and M. , A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks, Proceedings of the 12th International Conference on Distributed Computing and Networking (ICDCN), pp.215-226, 2011.
DOI : 10.1007/978-3-642-17679-1_19
URL : https://hal.archives-ouvertes.fr/hal-00647764

R. Baldoni, J. M. Hélary, M. Raynal, and L. Tangui, Consensus in Byzantine asynchronous systems, Journal of Discrete Algorithms, vol.1, issue.2, pp.185-210, 2003.
DOI : 10.1016/S1570-8667(03)00025-X
URL : https://hal.archives-ouvertes.fr/inria-00073018

M. Ben-or, Fast asynchronous byzantine agreement, Proceedings of the 4th Annual ACM Symposium on Principles Of Distributed Computing (PODC), pp.149-151, 1985.

E. R. Berlekamp, Algebraic Coding Theory, 1968.
DOI : 10.1142/9407

R. Bhagwan, S. Savage, and G. Voelker, Replication strategies for highly available peerto-peer storage, Proceedings of the 3rd International Workshop on Future Directions in Distributing Computing (FuDiCo), pp.153-158, 2003.

R. Bhagwan, S. Savage, and G. M. Voelker, Understanding Availability, Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), pp.256-267, 2003.
DOI : 10.1007/978-3-540-45172-3_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1523

R. Bhagwan, K. Tati, Y. C. Cheng, S. Savage, and G. M. Voelker, Total recall: System support for automated availability management, Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp.25-25, 2004.

A. B. Bondi, Characteristics of scalability and their impact on performance, Proceedings of the second international workshop on Software and performance , WOSP '00, pp.195-203, 2000.
DOI : 10.1145/350391.350432

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

Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, Making gnutellalike P2P systems scalable, Proceedings of the ACM SIGCOMM Conference on Applications , Technologies, Architectures, and Protocols for Computer Communications, pp.407-418, 2003.

G. H. Chen, F. Wu, H. X. Li, and T. Q. Qiu, Redundancy Schemes for High Availability in DHTs, Proceedings of the 3rd IEEE International Symposium on Parallel and Distributed Processing and Applications (ISPA), pp.990-1000, 2005.
DOI : 10.3724/SP.J.1016.2008.01695

R. Chien, Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes, IEEE Transactions on Information Theory, vol.10, issue.4, pp.357-363, 1964.
DOI : 10.1109/TIT.1964.1053699

C. K. Clarke, Reed-solomon error correction, BBC Research and Development, 2002.

M. Correia, N. F. Neves, and P. Veríssimo, From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures, The Computer Journal, vol.49, issue.1, pp.82-96, 2006.
DOI : 10.1093/comjnl/bxh145

M. Correia, G. S. Veronese, and L. C. Lung, Asynchronous Byzantine consensus with 2f+1 processes, Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10, pp.475-480, 2010.
DOI : 10.1145/1774088.1774187
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.8147

M. Correia, G. S. Veronese, N. F. Neves, and P. Verissimo, Byzantine consensus in asynchronous message-passing systems: a survey, International Journal of Critical Computer-Based Systems, vol.2, issue.2, pp.141-161, 2011.
DOI : 10.1504/IJCCBS.2011.041257

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, Wide-area cooperative storage with CFS, Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), pp.202-215, 2001.

S. Decker, M. Schlosser, M. Sintek, and W. Nejdl, Hypercup: Hypercubes, ontologies and efficient search on P2P networks, Proceedings of the 1st International Conference on Agents and Peer-to-Peer Computing (AP2PC), pp.112-124, 2003.

F. Depaoli and L. Mariani, Dependability in peer-to-peer systems, IEEE Internet Computing, vol.8, issue.4, pp.54-61, 2004.
DOI : 10.1109/MIC.2004.9

A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, Decentralized erasure codes for distributed networked storage, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2809-2816, 2006.
DOI : 10.1109/TIT.2006.874535

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

M. Gradinariu, M. Roy, E. Anceaume, and X. Defago, Toward a theory of self-organization, Proceedings of the 9th international conference on Principles of Distributed Systems (OPODIS), pp.191-205, 2005.

P. Elias, Coding for Noisy Channels, pp.37-46, 1955.

S. V. Fedorenko, A Simple Algorithm for Decoding Reed???Solomon Codes and its Relation to the Welch???Berlekamp Algorithm, IEEE Transactions on Information Theory, vol.51, issue.3, pp.1196-1198, 2005.
DOI : 10.1109/TIT.2004.842738

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

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of Distributed Consensus with One Faulty Process, Journal of the ACM, pp.374-382, 1985.

K. Fu, M. F. Kaashoek, and D. Mazieres, Fast and secure distributed read-only file system, ACM Transactions on Computer Systems, vol.20, issue.1, pp.1-24, 2002.
DOI : 10.1145/505452.505453
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.2834

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1963.
DOI : 10.1109/TIT.1962.1057683

S. Gao, A New Algorithm for Decoding Reed-Solomon Codes, Journal of Communications , Information and Network Security, pp.55-68, 2003.
DOI : 10.1007/978-1-4757-3789-9_5

P. Godfrey, S. Shenker, and I. Stoica, Minimizing churn in distributed systems, Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.147-158, 2006.

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, issue.2, pp.147-160, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x
URL : http://campus.unibo.it/10913/1/hamming1950.pdf

M. D. Hill, What is Scalability? ACM SIGARCH Computer Architecture News, pp.18-21, 1990.

R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, 1994.
DOI : 10.1017/CBO9780511840371

D. and J. F. Gantz, The digital universe decade, are you ready? Technical Report Online, International Data Corporation (IDC) & EMC Corporation, 2011.

V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-yazti, A local search mechanism for peer-to-peer networks, Proceedings of the eleventh international conference on Information and knowledge management , CIKM '02, pp.300-307, 2002.
DOI : 10.1145/584792.584842

D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine et al., Consistent hashing and random trees, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.654-663, 1997.
DOI : 10.1145/258533.258660

R. Koetter and A. Vardy, Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory, vol.49, issue.11, p.7, 2003.
DOI : 10.1109/TIT.2003.819332

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton et al., OceanStore: an Architecture for Global-Scale Persistent Storage, ACM SIGARCH Computer Architecture News, pp.190-201, 2000.

L. Lamport, Constructing digital signatures from a one-way function, 1979.

L. Lamport, Password authentication with insecure communication, Communications of the ACM, vol.24, issue.11, pp.770-772, 1981.
DOI : 10.1145/358790.358797

L. Lamport, R. Shostak, and M. 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

S. Lang, Algebraic Groups over Finite Fields, American Journal of Mathematics, pp.555-563, 1956.
DOI : 10.1007/978-1-4612-2118-0_12

J. C. Laprie, DEPENDABLE COMPUTING AND FAULT TOLERANCE : CONCEPTS AND TERMINOLOGY, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'., pp.2-13, 1995.
DOI : 10.1109/FTCSH.1995.532603

D. H. Lehmer, Euclid's Algorithm for Large Numbers, The American Mathematical Monthly, vol.45, issue.4, pp.227-233, 1938.
DOI : 10.2307/2302607

H. Li and G. Chen, Data Persistence in Structured P2P Networks with Redundancy Schemes, Sixth International Conference on Grid and Cooperative Computing (GCC 2007), pp.542-549, 2007.
DOI : 10.1109/GCC.2007.59

R. Lidl and H. Niederreiter, Finite Fields and Their Applications, 1996.
DOI : 10.1016/S1570-7954(96)80013-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5298

E. K. Lua, J. Crowcroft, M. Pias, and R. Sharma, A Survey and Comparison of Peer-to- Peer Overlay Network Schemes, IEEE Communications Surveys & Tutorials, pp.72-93, 2005.

M. Luby, LT codes, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.271-286, 2002.
DOI : 10.1109/SFCS.2002.1181950

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th International Conference on Supercomputing (ICS), pp.84-95, 2002.

L. T. Madhu and S. K. Sudan, Coding theory: Tutorial & Survey, SIAM Journal on Computing, pp.1863-1920, 2001.

D. Mandelbaum, On decoding of Reed-Solomon codes, IEEE Transactions on Information Theory, vol.17, issue.6, pp.707-712, 2002.
DOI : 10.1109/TIT.1971.1054724

P. Maymounkov, Online codes, 2002.

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

D. Mazieres, Self-certifying File System, 2000.

R. Merkle, Protocols for Public Key Cryptosystems, 1980 IEEE Symposium on Security and Privacy, pp.122-134, 1980.
DOI : 10.1109/SP.1980.10006

J. S. Plank and M. G. Thomason, A practical analysis of low-density parity-check erasure codes for wide-area storage applications, International Conference on Dependable Systems and Networks, 2004, pp.115-130, 2004.
DOI : 10.1109/DSN.2004.1311882

C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.241-280, 1997.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable contentaddressable network, Proceedings of the ACM SIGCOMM Computer Communication Review, pp.161-172, 2001.

I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.
DOI : 10.1137/0108018

S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao et al., Pond: The oceanstore prototype, Proceedings of the 2nd USENIX Conference on File and Storage Technologies, 2003.

H. Ribeiro and E. Anceaume, A Comparative Study of Rateless Codes for P2P Persistent Storage, Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems(SSS), pp.489-503, 2010.
DOI : 10.1007/978-3-642-16023-3_38
URL : https://hal.archives-ouvertes.fr/hal-00554699

H. B. Ribeiro and E. Anceaume, DataCube: A P2P Persistent Data Storage Architecture Based on Hybrid Redundancy Schema, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, pp.302-306, 2010.
DOI : 10.1109/PDP.2010.60

H. B. Ribeiro and E. Anceaume, Exploiting Rateless Coding in Structured Overlays to Achieve Data Persistence, 2010 24th IEEE International Conference on Advanced Information Networking and Applications, pp.1165-1172, 2010.
DOI : 10.1109/AINA.2010.61
URL : https://hal.archives-ouvertes.fr/hal-00554701

R. Rodrigues and B. Liskov, High Availability in DHTs: Erasure Coding vs. Replication, Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS), 2005.
DOI : 10.1007/11558989_21

A. Rowstron and P. Druschel, Storage Management and Caching in PAST, a Large- Scale, Persistent Peer-to-Peer Storage Utility, ACM SIGOPS Operating System Review, pp.188-201, 2001.

J. S. Russell, Report on waves, Proceedings of the 14th Meeting of the British Association for the Advancement of Science (BAAS), pp.311-390, 1844.

S. Matthew, G. R. Ryan, and . Nudd, The viterbi algorithm, 1993.

A. S. Tanenbaum, Distributed operating systems, ACM Computing Surveys, vol.17, issue.4, 1995.
DOI : 10.1145/6041.6074

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

R. Schollmeier, A definition of peer-to-peer networking for the classification of peer-topeer architectures and applications, Proceedings of the 1st IEEE International Conference on Peer-to-Peer Computing (P2P), pp.101-102, 2002.

C. E. Shannon, A Mathematical Theory of Communication, ACM SIGMOBILE Mobile Computing and Communications Review, pp.3-55, 2001.

C. Shikey, What is P2P...And What Isn't? O'Reilly Network, 2000.

A. Shokrollahi, Raptor codes, IEEE/ACM Transactions on Networking, pp.2551-2567, 2006.
DOI : 10.1109/tit.2006.874390

R. C. Singleton, Maximum distance q-nary codes, IEEE Transactions on Information Theory, pp.116-118, 1964.

S. H. Standard, FIPS Pub 180-1. National Institute of Standards and Technology, 1995.

R. Steinmetz and K. Wehrle, Peer-to-Peer-Networking & -Computing, Informatik-Spektrum, vol.27, issue.1, pp.51-54, 2004.
DOI : 10.1007/s00287-003-0362-9

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 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.149-160, 2001.

M. Sudan, Coding theory: tutorial & survey, Proceedings 2001 IEEE International Conference on Cluster Computing, p.36, 2001.
DOI : 10.1109/SFCS.2001.959879

R. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, vol.27, issue.5, pp.533-547, 1981.
DOI : 10.1109/TIT.1981.1056404

F. Vanhaverbeke, F. Simoens, M. Moeneclaey, and D. Vleeschauwer, Binary Erasure Codes for Packet Transmission Subject to Correlated Erasures, Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing (PCM), pp.48-55, 2006.
DOI : 10.1007/11922162_6

H. Weatherspoon, B. G. Chun, C. W. So, and J. Kubiatowicz, Long-term data maintenance in wide-area storage systems: A quantitative approach, 2005.

H. Weatherspoon and J. Kubiatowicz, Erasure Coding Vs. Replication: A Quantitative Comparison, Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), pp.328-337, 2002.
DOI : 10.1007/3-540-45748-8_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.9064

M. H. Weik, Communications Standard Dictionary, 1998.

Z. Zhang and Q. Lian, Reperasure: replication protocol using erasure-code in peer-to-peer storage network, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.330-339, 2002.
DOI : 10.1109/RELDIS.2002.1180205

B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph, Tapestry, ACM SIGCOMM Computer Communication Review, vol.32, issue.1, 2001.
DOI : 10.1145/510726.510755

X. Zhu, D. Zhang, W. Li, and K. Huang, A Prediction-Based Fair Replication Algorithm in Structured P2P Systems, Proceedings of the 4th International Conference on Autonomic and Trusted Computing (ATC), pp.499-508, 2007.
DOI : 10.1007/978-3-540-73547-2_51

R. Étendu-en-français and .. , Pair-à-Pair " de Stockage de Données Contents A.1 Introduction 121 A.2 Stockage Persistent Pair-à-Pair : Définitions, Terminologie, p.123