1. Shen, X. S., Yu, H., Buford, J., and Akon, M., eds. Handbook of peer-to-peer networking. Berlin: Springer Science and Business Media, 2010, vol. 34, 1500 pp.
2. Daswani, N., Garcia-Molina, H., and Yang, B. Open problems in data-sharing peer-to-peer systems, Proceedings of the 9th International Conference on Database Theory (ICDTT03), 2003, p. 1Ts15.
3. http://www.napster.com 
4. The Gnutella Protocol Specification. http://rfc-gnutella.sourceforge.net/developer/stable 
5. Good, N.S. and Krekelberg, A. Usability and privacy: a study of Kazaa P2P file-sharing, Procedings of the SIGCHI conference on Human factors in computing systems, 2003, p. 137Ts144.
6. Cohen, B. Incentives build robustness in BitTorrent, Proceedings of the Workshop on Economics of Peer-to-Peer systems, 2003, v. 6, pp. 68Ts72.
7. Rizzo, F., Spoto, G.L., Brizzi, P., Bonino, D., Di Bella, G., and Castrogiovanni, P. Beekup: A distributed and safe P2P storage framework for IoE applications, Proceedings of the 20th Conference on Innovations in Clouds, Internet and Networks (ICIN), 2017, pp. 44Ts51.
8. Meng, X. A churn-aware durable data storage scheme in hybrid P2P networks, The Journal of Supercomputing, 2018, v. 74, no. 1, pp. 183Ts204.
9. Osorio, M. and Buil-Aranda, C. Storage Balancing in P2P Based Distributed RDF Data Stores, 2017. https://openreview.net/pdf?id=rJn8cDtIb 
10. Theyyampattil, M.R. and James, M. A Survey on Reputation Systems and Social Network Based Peer-to-Peer File Sharing Systems, International Journal of Computer Science and Engineering, 2017, v. 5, no. 3, pp. 1619Ts1626.
11. Ravichandran, C.G. and Xavier, J.L. A survey of data sharing and security issues in P2P networks, Advances in Natural and Applied Sciences, 2017, v. 11, no. 7, pp. 329Ts335.
12. √urkin yo.Ќ., —emenov yo.ј. ‘ajloobmennye seti P2P: osnovnye printsipy, protokoly, bezopasnost' // —eti i sistemy sv¤zi: ehlektronnnyj zhurnal. 2012. http://www.ccc.ru/magazine/depot/06_11/  /read.html?0302.htm
13. Malatras, A. State-of-the-art survey on P2P overlay networks in pervasive computing environments, Journal of Network and Computer Applications, 2015, v. 55, pp. 1Ts23.
14. Meshkova, E., Riihijarvi, J., Petrova, M., and Mahonen, P. A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks, Computer networks, 2008, v. 52, no. 11, pp. 2097Ts2128.
15. Tsoumakos, D. and Roussopoulos, N. Adaptive probabilistic search in peer-to-peernetworks, Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPST03), 2003, pp. 102Ts109.
16. Yang, C. and Wu, J. A dominating-set-based routing in peer-to-peer networks, Proceedings of the 2nd International Workshop on Grid and Cooperative Computing Workshop (GCCT03), 2003, pp. 332Ts339.
17. Mizrak, A. T., Cheng, Y., Kumar, V., and Savage, S. Structured superpeers: leveraging heterogeneity to provide constant-time lookup, Proceedings of the IEEE Workshop on Internet Applications (WIAPPT03), 2003, pp. 104Ts111.
18. Li, J-S. and Chao, C-H. An efficient superpeer overlay construction and broadcasting scheme based on perfect difference graph, IEEE Transactions on Parallel and Distributed Systems, 2010, v. 21, no. 5, pp. 594Ts606.
19. Lv, Q., Cao, P., Cohen, E., Li, K., and Shenker, S. Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th ACM International Conference on Supercomputing (ACM ICST02), 2002, pp. 84Ts95.
20. Barjini, H., Othman, M., Ibrahim, H., and Udzir, N. Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured p2p networks, Peer-to-Peer Network Applications, 2012, v. 5, pp. 1Ts13.
21. Brocco, A., Malatras, A., and Hirsbrunner, B. Enabling efficient information discovery in a selfstructured grid, Future Generation Computer Systems, 2010, v. 26, no. 6, pp. 838Ts846.
22. Ciancaglini, V., Liquori, L., and Hoang, G. Towards a common architecture to interconnect heterogeneous overlay networks, Proceedings of the 17th international conference on parallel and distributed systems, 2011, pp. 817Ts822.
23. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., and Balakrishnan, H. Chord: A scalable peer-topeer lookup service for internet applications, IEEE/ACM Transactions on Networking (TON), 2003, v. 11, no. 1, pp. 17Ts32.
24. ¬arlamov ћ.»., “urdakov ƒ.yo. ќbzor metodov izvlecheni¤ informatsii iz veb-resursov // ѕrogrammirovanie. 2016. є 5. C. 30Ts48.
25. Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W. Freenet: A distributed anonymous information storage and retrieval system, In Designing privacy enhancing technologies, 2001, pp. 46Ts66.
26. Manku, G.S., Bawa, M., and Raghavan, P. Symphony: Distributed hashing in a small world, Proceedings of the 4th USENIX Symposium on Internet Technology and Systems (USITST03), 2003, p. 10Ts25.
27. Gupta, I., Birman, K., Linga, P., Demers, A., and Renesse, R.V. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPST03), 2003, pp. 160Ts169.
28. Demirci, M. and Ammar, M. Fair allocation of substrate resources among multiple overlay networks, Proceedings of the 2010 IEEE international symposium on modeling, analysis and simulation of computer and telecommunication systems (MASCOTST10), 2010, pp. 121Ts130.
29. Hsu, C-J., Chung, W-C., Lai, K-C., Li, K-C., and Chung, Y-C. A novel approach for cooperative overlay-maintenance in multi-overlay environments, Proceedings of the 2010 IEEE second international conference on cloud computing technology and science (CloudCom), 2010, pp. 81Ts88.
30. Peng, F., Malatras, A., Hirsbrunner, B., and Courant, M. Antom: constructing multi-layer overlays for pervasive environments, Proceedings of the eighth international workshop on mobile P2P computing (MP2PT12), 2012, pp. 1Ts6.
31. Buford, J., Yu, H., and Lua, E.K. P2P Networking and Applications. San Francisco: Morgan Kaufmann, 2008, 406 p.
32. Serbu, S., Felber, P., and Kropf, P. Hypeer: structured overlay with flexible-choice routing, Comuter Networks, 2011, v. 55, no. 1, pp. 300Ts313.
33. Balakrishnan, H., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. Looking up data in P2P systems, Communications of ACM, 2003, v. 46, no. 2, pp. 43Ts48.
34. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A scalable contentaddressable network, ACM SIGCOMM Computer Communication Review, Proceedings of the 2001 SIGCOMM conference, 2001, v. 31, pp. 161Ts172.
35. Rowstron, A. and Druschel, P. Pastry: scalable, decentralized object location, and routing for largescale peer-to-peer systems, Proceedings of the IFIP/ACM international conference on distributed systems platforms, 2001, pp. 329Ts350.
36. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., and Kubiatowicz, J.D. Tapestry: a resilient global-scale overlay for service deployment, IEEE Journal on selected areas in communications, 2004, v. 22, no. 1, pp. 41Ts53.
37. Maymounkov, P. and Mazieres, D. Kademlia: a peer-to-peer information system based on the XOR metric, Proceedings of first international workshop on peer-to-peer systems (IPTPST01), 2002, pp. 53Ts65.
38. Malkhi, D., Naor, M., and Ratajczak, D. Viceroy: a scalable and dynamic emulation of the butterfly, Proceedings of the 21st symposium on principles of distributed computing (PODCT02), 2002, pp. 183Ts192.
39. Aberer, K., Cudre-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., and Punceva, M. P-grid: a self-organizing structured p2p system, SIGMOD Record, 2003, v. 32, no. 3, pp. 29Ts33.
40. Harvey, N., Jones, M., Saroiu, S., Theimer, M., and Wolman, A. Skipnet: a scalable overlay network with practical locality properties, Proceedings of the fourth USENIX symposium on Internet technologies and systems (USITST03), 2003, pp. 1Ts38.
41. Albert, R. and Barabasi, A.-L. Statistical mechanics of complex networks, Review Modern Physics, 2002, v. 74, pp 47Ts98.
42. Estrada, E. The Structure of Complex Networks: Theory and Applications, Oxford: Oxford University Press, 2011, 480 p.
43. Cohen, R. and Havlin, S. Complex Networks. Structure, Robustness and Function, Cambridge: Cambridge University Press, 2010, 248 p.
44. Ciancaglini, V., Gaeta, R., Loti, R., and Liquori, L. Interconnection of large scale unstructured p2p networks: modeling and analysis, Lecture notes in computer science. Analytical and stochastic modeling techniques and applications, 2013, v. 7984, pp. 183Ts197.
45. Leitao, J., Marques, J.P., Pereira, J., and Rodrigues, L. X-bot: a protocol for resilient optimization of unstructured overlay networks, IEEE Transactions on Parallel and Distributed Systems, 2012, v. 23, no. 11, pp. 2175Ts2188.
46. Matos, R., Marques, C., and Sargento, S. Distributed approach to control and manage contextbased multi-virtual networks, Mobile Networks Applications, 2012, v. 17, no. 4, pp. 447Ts462.
47. Liang, J., Kumar, R., and Ross, K.W. The fasttrack overlay: a measurement study, Computer Networks, 2006, v. 50, no. 6, pp. 842Ts858.
48. Cohen, B. Incentives build robustness in BitTorrent, Proceedings of the Workshop on Economics of Peer-to-Peer systems, 2003, v. 6, pp. 68Ts72.
49. Ripeanu, M., Iamnitchi, A., Foster, I., and Rogers, A. In search of simplicity: a self-organizing group communication overlay, Concurrency and Computation: Practice and Experience, 2010, v. 22, pp. 788Ts815.
50. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., and Shenker, S. Making gnutellalike p2p systems scalable, Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMMT03), 2003, pp. 407Ts418.
51. Wouhaybi, R.H. and Campbell, A.T. Phenix: supporting resilient low-diameter peer-to-peer topologies, Proceedings of the 23rd joint conference of the IEEE computer and communications societies (INFOCOMT04), 2004, pp. 1Ts12.
52. Carchiolo, V., Malgeri, M., Mangioni, G., and Nicosia, V. An adaptive overlay network inspired by social behaviour, Journal of Parallel and Distributed Computing, 2010, v. 70, no. 3, pp. 282Ts295.
53. Babaoglu, O., Canright, G., Deutsch, A., di Caro, G.A., Ducatelle, F., and Gambardella, L.M. Design patterns from biology for distributed computing, ACM Transactions on Autonomous and Adaptive Systems, 2006, v. 1, no. 1, pp. 26Ts66.
54. Balasubramaniam, S., Leibnitz, K., Lio, P., Botvich, D., and Murata, M. Biological principles for future Internet architecture design, IEEE Communications Magazine, 2011, v. 49, no. 7, pp. 44Ts52.
55. Brocco, A. and Baumgart, I. A framework for a comprehensive evaluation of ant-inspired peer-to-peer protocols, Proceedings of the 20th Euromicro international conference on parallel, distributed and network-based processing (PDP), 2012, pp. 303Ts310.
56. Dressler, F. and Akan, O.B. Bio-inspired networking: from theory to practice, IEEE Communications Magazine, 2010, v. 48, no. 11, pp. 176Ts183.
57. Brocco, A., Malatras, A., Hirsbrunner, B. Enabling efficient information discovery in a self-structured grid, Future Generation Computer Systems, 2010, v. 26, no. 6, pp. 838Ts846.
58. Peng, F., Malatras, A., Hirsbrunner, B., and Courant, M. Antom: constructing multi-layer overlays for pervasive environments, Proceedings of the Eighth international workshop on mobile P2P computing (MP2PT12), 2012, pp. 1Ts6.
59. Forestiero, A., Leonardi, E., Mastroianni, C., and Meo, M. Self-chord: a bio-inspired p2p framework for self-organizing distributed systems, IEEE/ACM Transactions on Networking (TON), 2010, v. 18, no. 5, pp. 1651Ts1664.
60. Barthelemy, M. Spatial Networks, Physics Reports, 2011, v. 499, pp. 1Ts101.
61. Wallach, D. A survey of peer-to-peer security issues, Proceedings of the International Symposium on Software Security Ch Theories and Systems. 2002. pp. 42Ts57.
62. Marmol, F.G. and Perez, G.M. State of the art in trust and reputation models in P2P networks, Handbook of Peer-to-Peer Networking. 2010. pp. 761Ts784.
63. Urdaneta, G., Pierre, G., and van Steen, M. A survey of DHT security techniques, ACM Computer Survey, 2011, v. 43, no. 2, pp. 1Ts49.
64. “ormasov ј., Ћysov ј., ћazur Yo. –aspredelennye sistemy khraneni¤ dannykh: analiz, klassifikatsi¤ i varianty vybora // “rudy »—ѕ –јЌ. 2015. “. 27. є 6. —. 225Ts252.
65.  uznetsov —., ѕoskonin ј. —istemy upravleni¤ dannymi kategorii NoSQL // ѕrogrammirovanie. 2014. “. 40. є 6. C. 34Ts47.
66. Rabin, M.O. Efficient dispersal of information for security, load balancing and fault tolerance, Journal of the ACM, 1989, v. 36, no. 2, pp. 335Ts348.
67. Dimakis, A.G., Ramchandran, K., Wu, Y., and Suh, C. A survey on network codes for distributed storage, Proceedings of the IEEE, 2011, v. 99, є 3, pp. 476Ts489.
68. Weatherspoon, H. and Kubiatowicz, J.D. Erasure coding vs. replication: a quantitiative comparison, Proceedings of the InInternational Workshop on Peer-to-Peer Systems (IPTPS), 2002, pp. 328Ts337.
69. ѕiterson ”., ”ehldon Yo.  ody, ispravl¤yuschie oshibki. ћ.: ћir, 1976. 596 s.
70. Ateniese G., Burns R., Curtmola R., Herring J., Kissner L., Peterson Z., and Song D. Provable data possession at untrusted stores, Proceedings of the 14th ACM conference on Computer and communications security, 2007, pp. 598Ts609.
71. Ateniese, G., Pietro, R.D., Mancini, L.V., and Tsudik, G. Scalable and efficient provable data possession, Proceedings of the 4th international conference on Security and privacy in communication networks, 2008, p. 9.
72. Wang, C., Ren, K. and Wang, J. Secure and practical outsourcing of linear programming in cloud computing, Proceedings of IEEE INFOCOM, 2011, pp. 820Ts828.
73. Juels, A. and Kaliski, B.S. PORs: Proofs of retrievability for large files, Proceedings of the 14th ACM conference on Computer and communications security, 2007, pp. 584Ts597.
74. Dodis, Y., Vadhan, S. and Wichs, D. Proofs of retrievability via hardness implication, Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography, 2009, pp. 109Ts127.
75. Sookhak, M., Talebian, H., Ahmed, E., Gani, A., and Khan, M.K. A review on remote data auditing in single cloud server: Taxonomy and open issues, Journal of Network and Computer Applications, 2014, v. 43, pp. 121Ts141.
76. ћao, ¬. —ovremenna¤ kriptografi¤: “eori¤ i praktika. ћ.: ¬il'¤ms, 2005. 768 s.
77. Szabo, N. The Idea of Smart Contracts. 1997. http://www.fon.hum.uva.nl/rob/Courses/  InformationInSpeech/CDROM/Literature/ LOTwinterschool2006/szabo.best.vwh.net/ smart_contracts_idea.html
78. BitFury Group. Public versus Private Blockchains. 2015. http://bitfury.com/content/5-white-papersresearch/  public-vs-private-pt1-1.pdf
79. Buterin, V. Ethereum White Paper. 2016. https://github.com/ethereum/wiki/wiki/White-  Paper
80. Wood, G. Ethereum: A secure decentralised generalised transaction ledger, 2015. http://gavwood.com/paper.pdf 
81. Franco, P. Understanding Bitcoin. Cryptography, engineering, and economics. West Sussex: John Wiley and Sons, 2015. 288 p.
82. Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M., and Morris, R. Designing a DHT for low latency and high throughput, Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI), 2004, v. 4, pp. 85Ts98.
83. Flocchini, P., Nayak, A. and Xie, M. Enhancing Peer-to-Peer Systems Through Redundancy, IEEE Journal on selected areas in communications, 2007, v. 25, no. 1, pp. 15Ts24.
84. Giordanelli, R., Mastroianni, C., and Meo, M. Bioinspired p2p systems: the case of multidimensional overlay, ACM Transactions on Autonomous and Adaptive Systems (TAAS), 2012, v. 7, no. 4, pp. 1Ts28.
85. Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W. Freenet: a distributed anonymous information storage and retrieval system, Proceedings of the International workshop on designing privacy enhancing technologies: design issues in anonymity and unobservability, 2001, pp. 46Ts66.
86. Wilkinson, S., Boshevski, T., Brandoff, J., and Buterin, V. Storj. A peer-to-peer cloud storage network, 2014. https://storj.io/storj.pdf 
87. Vorick, D. and Champine, L. Sia: Simple Decentralized Storage. Technical Report, 2014. https://sia.tech/sia.pdf