{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:56:06Z","timestamp":1775278566236,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Tor is an open source software that allows accessing various kinds of resources, known as hidden services, while guaranteeing sender and receiver anonymity. Tor relies on a free, worldwide, overlay network, managed by volunteers, that works according to the principles of onion routing in which messages are encapsulated in layers of encryption, analogous to layers of an onion. The Tor Web is the set of web resources that exist on the Tor network, and Tor websites are part of the so-called dark web. Recent research works have evaluated Tor security, its evolution over time, and its thematic organization. Nevertheless, limited information is available about the structure of the graph defined by the network of Tor websites, not to be mistaken with the network of nodes that supports the onion routing. The limited number of entry points that can be used to crawl the network, makes the study of this graph far from being simple. In the present paper we analyze two graph representations of the Tor Web and the relationship between contents and structural features, considering three crawling datasets collected over a five-month time frame. Among other findings, we show that Tor consists of a tiny strongly connected component, in which link directories play a central role, and of a multitude of services that can (only) be reached from there. From this viewpoint, the graph appears inefficient. Nevertheless, if we only consider mutual connections, a more efficient subgraph emerges, that is, probably, the backbone of social interactions in Tor.<\/jats:p>","DOI":"10.1007\/s11280-022-01044-z","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:26:27Z","timestamp":1648826787000},"page":"1287-1313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Onion under Microscope: An in-depth analysis of the Tor Web"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3661-9836","authenticated-orcid":false,"given":"Massimo","family":"Bernaschi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8493-4550","authenticated-orcid":false,"given":"Alessandro","family":"Celestini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6775-7804","authenticated-orcid":false,"given":"Marco","family":"Cianfriglia","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Guarino","sequence":"additional","affiliation":[]},{"given":"Flavio","family":"Lombardi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0023-7943","authenticated-orcid":false,"given":"Enrico","family":"Mastrostefano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,1]]},"reference":[{"key":"1044_CR1","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.eswa.2019.01.029","volume":"123","author":"MW Al-Nabki","year":"2019","unstructured":"Al-Nabki, M.W., Fidalgo, E., Alegre, E., Fern\u00e1ndez-Robles, L.: Torank: Identifying the most influential suspicious domains in the tor network. Expert Systems with Applications 123, 212\u2013226 (2019)","journal-title":"Expert Systems with Applications"},{"key":"1044_CR2","doi-asserted-by":"crossref","unstructured":"Al\u00a0Nabki, M.W., Fidalgo, E., Alegre, E., de\u00a0Paz, I.: Classifying illegal activities on tor network based on web textual contents. In: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pp. 35\u201343 (2017)","DOI":"10.18653\/v1\/E17-1004"},{"issue":"1","key":"1044_CR3","doi-asserted-by":"publisher","first-page":"e85777","DOI":"10.1371\/journal.pone.0085777","volume":"9","author":"J Alstott","year":"2014","unstructured":"Alstott, J., Bullmore, E., Plenz, D.: Powerlaw: a Python package for analysis of heavy-tailed distributions. PloS One 9(1), e85777 (2014)","journal-title":"PloS One"},{"key":"1044_CR4","doi-asserted-by":"crossref","unstructured":"Annessi, R., Schmiedecker, M.: Navigator: Finding faster paths to anonymity. In: IEEE European Symposium on Security and Privacy (Euro S&P). IEEE (2016)","DOI":"10.1109\/EuroSP.2016.26"},{"issue":"4","key":"1044_CR5","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/3008662","volume":"11","author":"M Bernaschi","year":"2017","unstructured":"Bernaschi, M., Celestini, A., Guarino, S., Lombardi, F.: Exploring and analyzing the tor hidden services graph. ACM Trans. Web 11(4), 24:1-24:26 (2017). https:\/\/doi.org\/10.1145\/3008662","journal-title":"ACM Trans. Web"},{"key":"1044_CR6","doi-asserted-by":"publisher","unstructured":"Bernaschi, M., Celestini, A., Guarino, S., Lombardi, F., Mastrostefano, E.: Spiders like onions: On the network of tor hidden services. In: The World Wide Web Conference, WWW \u201919, pp. 105\u2013115. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3308558.3313687","DOI":"10.1145\/3308558.3313687"},{"key":"1044_CR7","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Pustogarov, I., Thill, F., Weinmann, R.P.: Content and popularity analysis of tor hidden services. In: Distributed Computing Systems Workshops (ICDCSW), 2014 IEEE 34th International Conference on, pp. 188\u2013193 (2014). https:\/\/doi.org\/10.1109\/ICDCSW.2014.20","DOI":"10.1109\/ICDCSW.2014.20"},{"key":"1044_CR8","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Pustogarov, I., Weinmann, R.P.: Trawling for tor hidden services: Detection, measurement, deanonymization. In: Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP \u201913, pp. 80\u201394. IEEE Computer Society, Washington, DC, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.15","DOI":"10.1109\/SP.2013.15"},{"issue":"10","key":"1044_CR9","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10), P10008 (2008)","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"1044_CR10","doi-asserted-by":"crossref","unstructured":"Boldi, P., Marino, A., Santini, M., Vigna, S.: Bubing: Massive crawling for the masses. In: Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion, pp. 227\u2013228 (2014)","DOI":"10.1145\/2567948.2577304"},{"issue":"1\u20136","key":"1044_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Computer Networks 33(1\u20136), 309\u2013320 (2000). https:\/\/doi.org\/10.1016\/S1389-1286(00)00083-9","journal-title":"Computer Networks"},{"key":"1044_CR12","doi-asserted-by":"publisher","unstructured":"Celestini, A., Guarino, S.: Design, implementation and test of a flexible tor-oriented web mining toolkit. In: Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics, WIMS \u201917, pp. 19:1\u201319:10. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3102254.3102266","DOI":"10.1145\/3102254.3102266"},{"key":"1044_CR13","doi-asserted-by":"publisher","unstructured":"Christin, N.: Traveling the silk road: A measurement analysis of a large anonymous online marketplace. In: Proceedings of the 22Nd International Conference on World Wide Web, WWW \u201913, pp. 213\u2013224. ACM, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488388.2488408","DOI":"10.1145\/2488388.2488408"},{"issue":"4","key":"1044_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM Review 51(4), 661\u2013703 (2009)","journal-title":"SIAM Review"},{"key":"1044_CR15","doi-asserted-by":"publisher","first-page":"022313","DOI":"10.1103\/PhysRevE.95.022313","volume":"95","author":"M De Domenico","year":"2017","unstructured":"De Domenico, M., Arenas, A.: Modeling structure and resilience of the dark network. Phys. Rev. E 95, 022313 (2017). https:\/\/doi.org\/10.1103\/PhysRevE.95.022313","journal-title":"Phys. Rev. E"},{"issue":"4","key":"1044_CR16","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s10940-017-9359-4","volume":"34","author":"SW Duxbury","year":"2018","unstructured":"Duxbury, S.W., Haynie, D.L.: The network structure of opioid distribution on a darknet cryptomarket. Journal of Quantitative Criminology 34(4), 921\u2013941 (2018)","journal-title":"Journal of Quantitative Criminology"},{"issue":"6","key":"1044_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1953122.1953146","volume":"54","author":"M Franceschet","year":"2011","unstructured":"Franceschet, M.: Pagerank: Standing on the shoulders of giants. Commun. ACM 54(6), 92\u2013101 (2011). https:\/\/doi.org\/10.1145\/1953122.1953146","journal-title":"Commun. ACM"},{"key":"1044_CR18","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Das, A., Porras, P., Yegneswaran, V., Gehani, A.: Automated categorization of onion sites for analyzing the darkweb ecosystem. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201917, pp. 1793\u20131802. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3097983.3098193","DOI":"10.1145\/3097983.3098193"},{"issue":"12","key":"1044_CR19","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"1044_CR20","unstructured":"Griffith, V., Xu, Y., Ratti, C.: Graph theoretic properties of the darkweb. arXiv:1704.07525 (2017)"},{"key":"1044_CR21","doi-asserted-by":"publisher","unstructured":"Guarino, S., Trino, N., Celestini, A., Chessa, A., Riotta, G.: Characterizing networks of propaganda on twitter: a case study. Applied Network Science 5(1) (2020). https:\/\/doi.org\/10.1007\/s41109-020-00286-y","DOI":"10.1007\/s41109-020-00286-y"},{"key":"1044_CR22","unstructured":"Jansen, R., Bauer, K., Hopper, N., Dingledine, R.: Methodically modeling the tor network. In: Proceedings of the 5th USENIX Conference on Cyber Security Experimentation and Test, CSET\u201912, pp. 8\u20138. USENIX Association, Berkeley, CA, USA (2012). http:\/\/dl.acm.org\/citation.cfm?id=2372336.2372347"},{"key":"1044_CR23","first-page":"32","volume":"1","author":"R Khare","year":"2004","unstructured":"Khare, R., Cutting, D., Sitaker, K., Rifkin, A.: Nutch: A flexible and scalable open-source web search engine. Oregon State University 1, 32\u201332 (2004)","journal-title":"Oregon State University"},{"key":"1044_CR24","doi-asserted-by":"publisher","unstructured":"Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: The web as a graph: Measurements, models, and methods. In: Asano, T., Imai, H., Lee, D., Nakano, S.i., Tokuyama, T. (eds.) Computing and Combinatorics, Lecture Notes in Computer Science, vol. 1627, pp. 1\u201317. Springer Berlin Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48686-0_1","DOI":"10.1007\/3-540-48686-0_1"},{"issue":"5","key":"1044_CR25","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604\u2013632 (1999)","journal-title":"Journal of the ACM (JACM)"},{"key":"1044_CR26","doi-asserted-by":"publisher","unstructured":"Lehmberg, O., Meusel, R., Bizer, C.: Graph structure in the web: Aggregated by pay-level domain. In: Proceedings of the 2014 ACM Conference on Web Science, WebSci \u201914, pp. 119\u2013128. ACM, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2615569.2615674","DOI":"10.1145\/2615569.2615674"},{"issue":"2","key":"1044_CR27","doi-asserted-by":"publisher","first-page":"022801","DOI":"10.1103\/PhysRevE.87.022801","volume":"87","author":"N Litvak","year":"2013","unstructured":"Litvak, N., Van Der Hofstad, R.: Uncovering disassortativity in large scale-free networks. Physical Review E 87(2), 022801 (2013)","journal-title":"Physical Review E"},{"issue":"2","key":"1044_CR28","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","volume":"1","author":"M Mitzenmacher","year":"2004","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet mathematics 1(2), 226\u2013251 (2004)","journal-title":"Internet mathematics"},{"key":"1044_CR29","unstructured":"Mohr, G., Stack, M., Ranitovic, I., Avery, D., Kimpton, M.: An introduction to heritrix an open source archival quality web crawler. In: In IWAW\u20194, 4th International Web Archiving Workshop. Citeseer (2004)"},{"issue":"2","key":"1044_CR30","doi-asserted-by":"publisher","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67(2), 026126 (2003). https:\/\/doi.org\/10.1103\/PhysRevE.67.026126","journal-title":"Phys. Rev. E"},{"key":"1044_CR31","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.drugpo.2018.03.016","volume":"56","author":"L Norbutas","year":"2018","unstructured":"Norbutas, L.: Offline constraints in online drug marketplaces: An exploratory analysis of a cryptomarket trade network. International Journal of Drug Policy 56, 92\u2013100 (2018)","journal-title":"International Journal of Drug Policy"},{"issue":"3","key":"1044_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1049\/iet-ifs.2015.0121","volume":"10","author":"G Owen","year":"2016","unstructured":"Owen, G., Savage, N.: Empirical analysis of tor hidden services. IET Information Security 10(3), 113\u2013118 (2016)","journal-title":"IET Information Security"},{"key":"1044_CR33","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Tech. rep, Stanford InfoLab (1999)"},{"key":"1044_CR34","doi-asserted-by":"publisher","unstructured":"Sanchez-Rola, I., Balzarotti, D., Santos, I.: The onions have eyes: A comprehensive structure and privacy analysis of tor hidden services. In: Proceedings of the 26th International Conference on World Wide Web, WWW \u201917, pp. 1251\u20131260. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland (2017). https:\/\/doi.org\/10.1145\/3038912.3052657","DOI":"10.1145\/3038912.3052657"},{"issue":"1","key":"1044_CR35","doi-asserted-by":"publisher","first-page":"2811","DOI":"10.1038\/s41598-018-21133-2","volume":"8","author":"P Sheridan","year":"2018","unstructured":"Sheridan, P., Onodera, T.: A preferential attachment paradox: How preferential attachment combines with growth to produce networks with log-normal in-degree distributions. Scientific Reports 8(1), 2811 (2018)","journal-title":"Scientific Reports"},{"key":"1044_CR36","doi-asserted-by":"publisher","unstructured":"Spitters, M., Verbruggen, S., van Staalduinen, M.: Towards a comprehensive insight into the thematic organization of the tor hidden services. In: Intelligence and Security Informatics Conference (JISIC), 2014 IEEE Joint, pp. 220\u2013223 (2014). https:\/\/doi.org\/10.1109\/JISIC.2014.40","DOI":"10.1109\/JISIC.2014.40"},{"key":"1044_CR37","doi-asserted-by":"crossref","unstructured":"Takaaki, S., Atsuo, I.: Dark web content analysis and visualization. In: Proceedings of the ACM International Workshop on Security and Privacy Analytics, pp. 53\u201359. ACM (2019)","DOI":"10.1145\/3309182.3309189"},{"key":"1044_CR38","doi-asserted-by":"crossref","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of the 26th annual international conference on machine learning, pp. 1073\u20131080 (2009)","DOI":"10.1145\/1553374.1553511"},{"key":"1044_CR39","doi-asserted-by":"crossref","unstructured":"Zabihimayvan, M., Sadeghi, R., Doran, D., Allahyari, M.: A broad evaluation of the tor english content ecosystem. arXiv:1902.06680 (2019)","DOI":"10.1145\/3292522.3326031"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01044-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-022-01044-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01044-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T12:15:30Z","timestamp":1652271330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-022-01044-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1044"],"URL":"https:\/\/doi.org\/10.1007\/s11280-022-01044-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"assertion":[{"value":"27 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}