{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:40:08Z","timestamp":1762954808842,"version":"3.41.2"},"reference-count":45,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T00:00:00Z","timestamp":1233273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,30]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to model and study the effectiveness of an attack on the anonymity of Internet users by a group of collaborating eavesdroppers.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The paper is based on an analysis of the Internet topology. The study is based on two methods for choosing nodes that contribute the most to the detection of as many communicating Internet users as possible.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The paper illustrates that it is possible to compromise the anonymity of many Internet users when eavesdropping on a relatively small number of nodes, even when the most central ones are protected from eavesdropping.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>It is assumed that the Internet users under attack are not using any anonymity enhancing technologies, but nodes can be protected from eavesdropping. It proposes a measure of the success of an attack on Internet users' anonymity, for a given deployment of collaborating eavesdroppers in the Internet.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The paper shows that several, and not necessarily the most prominent, collaborating nodes can compromise the anonymity of a considerable portion of Internet users. This study also emphasizes that when trying to completely compromise the anonymity of Internet users, an eavesdroppers' deployment strategy that considers eavesdroppers' collaboration can result in substantial resource saving compared to choosing a set of the most prominent nodes.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper proposes a new measure of anonymity level in the network, based on the linkability of the Internet users. This paper is the first to present results of a non\u2010trivial Group Betweenness optimization strategy in large complex networks.<\/jats:p><\/jats:sec>","DOI":"10.1108\/10662240910927821","type":"journal-article","created":{"date-parts":[[2009,1,17]],"date-time":"2009-01-17T07:22:23Z","timestamp":1232176943000},"page":"60-77","source":"Crossref","is-referenced-by-count":23,"title":["Collaborative attack on Internet users' anonymity"],"prefix":"10.1108","volume":"19","author":[{"given":"Rami","family":"Puzis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Yagil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Elovici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Braha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2021010422431720600_b1","unstructured":"Barab\u00e1si, A.\u2010L. and Albert, R. (1999), \u201cEmergence of scaling in random networks\u201d, Science, No. 286, pp. 509\u201012, available at: http:\/\/arXiv.org\/abs\/cond\u2010mat\/9910332."},{"key":"key2021010422431720600_b2","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.\u2010L., Albert, R. and Jeong, H. (2000), \u201cScale\u2010free characteristics of random networks: the topology of the world\u2010wide web\u201d, Physica A, No. 281, pp. 69\u201077.","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"key2021010422431720600_b3","doi-asserted-by":"crossref","unstructured":"Barth\u00e9lemy, M. (2004), \u201cBetweenness centrality in large complex networks\u201d, European Physical Journal B, Vol. 38 No. 2, pp. 163\u20108.","DOI":"10.1140\/epjb\/e2004-00111-4"},{"key":"key2021010422431720600_b4","unstructured":"Berthold, O., Federrath, H. and K\u00f6hntopp, M. (2000), \u201cProject anonymity and unobservability in the Internet\u201d, Proceedings of the Tenth Conference on Computers, Freedom and Privacy: Challenging the Assumptions, pp. 57\u201068."},{"key":"key2021010422431720600_b5","unstructured":"Bethencourt, J., Franklin, J. and Vernon, M. (2005), \u201cMapping internet sensors with probe response attacks\u201d, Proceedings of the 14th Conference on USENIX Security Symposium, Berkeley, CA, Vol. 14, p. 13."},{"key":"key2021010422431720600_b6","doi-asserted-by":"crossref","unstructured":"Boyan, J. (1997), \u201cThe anonymizer \u2013 protecting user privacy on the web\u201d, Computer\u2010mediated Communication Magazine, Vol. 4 No. 9, pp. 7\u201013, available at: www.december.com\/cmc\/mag\/1997\/sep\/boyan.html.","DOI":"10.1016\/S1361-3723(97)89536-X"},{"key":"key2021010422431720600_b7","unstructured":"Brandes, U. (2001), \u201cA faster algorithm for betweenness centrality\u201d, Journal of Mathematical Sociology, Vol. 25 No. 2, pp. 163\u201077."},{"key":"key2021010422431720600_b8","unstructured":"Brandes, U. (2008), \u201cOn variants of shortest\u2010path betweenness centrality and their generic computation\u201d, Social Networks, Vol. 30 No. 2, pp. 136\u201045."},{"key":"key2021010422431720600_b9","unstructured":"Cai, M., Hwang, K., Kwok, Y., Song, S. and Chen, Y. (2005), \u201cCollaborative Internet worm containment\u201d, IEEE Security and Privacy, Vol. 3 No. 3, pp. 25\u201033."},{"key":"key2021010422431720600_b10","unstructured":"CAIDA (2008), \u201cAS relationships dataset\u201d, March 24, avilable at: www.caida.org\/data\/active\/as\u2010relationships\/ (accessed October 21, 2008)."},{"key":"key2021010422431720600_b11","doi-asserted-by":"crossref","unstructured":"Chaum, D. (1981), \u201cUntraceable electronic mail, return addresses, and digital pseudonyms\u201d, Communications of the ACM, Vol. 24 No. 2, pp. 84\u20108.","DOI":"10.1145\/358549.358563"},{"key":"key2021010422431720600_b12","unstructured":"Claessens, J., Preneel, B. and Vandewalle, J. (1999), \u201cSolutions for anonymous communication on the internet\u201d, Proceedings of the 1999 IEEE International Carnahan Conference on Security Technology, pp. 298\u2010303."},{"key":"key2021010422431720600_b13","unstructured":"Claessens, J., D\u00edaz, C., Goemans, C., Dumortier, J., Preneel, B. and Vandewalle, J. (2003), \u201cRevocable anonymous access to the Internet?\u201d, Internet Research, Vol. 13 No. 4, pp. 242\u201058."},{"key":"key2021010422431720600_b14","unstructured":"D\u00edaz, C., Seys, S., Claessens, J. and Preneel, B. (2003), \u201cTowards measuring anonymity\u201d, in Dingledine, R. and Syverson, P. (Eds), Designing Privacy Enhancing Technologies, LNCS 2009, Springer\u2010Verlag, Berlin and Heidelberg, pp. 54\u201068."},{"key":"key2021010422431720600_b15","unstructured":"Edman, M., Sivrikaya, F. and Yener, B. (2007), \u201cA combinatorial approach to measuring anonymity\u201d, Intelligence and Security Informatics, 2007, IEEE, New York, NY, pp. 356\u201063."},{"key":"key2021010422431720600_b16","unstructured":"Elovici, Y. and Glezer, C. (2003), \u201cAnonymity enhancing technologies (AET): opportunities and threats\u201d, The Journal of Information Warfare, Vol. 3 No. 3, pp. 48\u201064."},{"key":"key2021010422431720600_b17","unstructured":"Everett, M.G. and Borgatti, S. (1999), \u201cThe centrality of groups and classes\u201d, Mathematical Sociology, Vol. 23 No. 3, pp. 181\u2010201."},{"key":"key2021010422431720600_b18","unstructured":"Faloutsos, M., Faloutsos, P. and Faloutsos, C. (1999), \u201cOn power\u2010law relationships of the Internet topology\u201d, Computer Communication Review, Vol. 29 No. 4, pp. 251\u201062."},{"key":"key2021010422431720600_b19","doi-asserted-by":"crossref","unstructured":"Freedman, M.J. and Morris, R. (2002), \u201cTarzan: a peer\u2010to\u2010peer anonymizing network layer\u201d, Proceedings of the ACM Conference on Computer and Communications Security (CCS 9).","DOI":"10.1145\/586110.586137"},{"key":"key2021010422431720600_b20","unstructured":"Freeman, L.C. (1977), \u201cA set of measuring centrality based on betweenness\u201d, Sociometry, Vol. 40 No. 1, pp. 35\u201041."},{"key":"key2021010422431720600_b21","unstructured":"Gabber, E., Gibbons, P.B., Matias, Y. and Mayer, A. (1997), \u201cHow to make personalized web browsing simple, secure, and anonymous\u201d, Proceedings of Financial Cryptography, LNCS 1318, Springer\u2010Verlag, Berlin, pp. 17\u201031."},{"key":"key2021010422431720600_b22","unstructured":"Goldschlag, D.M., Reed, M.G. and Syverson, P.F. (1999), \u201cOnion routing for anonymous and private Internet connections\u201d, Communications of the ACM, Vol. 42 No. 2, pp. 39\u201041."},{"key":"key2021010422431720600_b23","unstructured":"Gritzalis, S. (2004), \u201cEnhancing web privacy and anonymity in the digital era\u201d, Information Management & Computer Security, Vol. 12 No. 3, pp. 255\u201088."},{"key":"key2021010422431720600_b24","unstructured":"Holme, P. (2003), \u201cCongestion and centrality in traffic flow on complex networks\u201d, Advances in Complex Systems, Vol. 6 No. 2, p. 163."},{"key":"key2021010422431720600_b25","unstructured":"Pfitzmann, A. and Hansen, M. (2008), \u201cAnonymity, unlinkability, unobservability and pseudonymity, and identity management \u2013 a consolidated proposal for terminology v0.31\u201d, February, avilable at: http:\/\/dud.inf.tu\u2010dresden.de\/literatur."},{"key":"key2021010422431720600_b26","unstructured":"Pfitzmann, A. and Waidner, M. (1986), \u201cNetworks without user observability \u2013 design options\u201d, Eurocrypt 85, LNCS 219, Vol. 219, Springer\u2010Verlag, Berlin, pp. 245\u201053."},{"key":"key2021010422431720600_b27","unstructured":"Pfitzmann, A. and Waidner, M. (1989), \u201cNetworks without user observability\u201d, Computer & Security, Vol. 2 No. 6, pp. 158\u201066."},{"key":"key2021010422431720600_b28","unstructured":"Puzis, R., Elovici, Y. and Dolev, S. (2007a), \u201cFinding the most prominent group in complex networks\u201d, AI Communications, Vol. 20 No. 4, pp. 287\u201096."},{"key":"key2021010422431720600_b29","doi-asserted-by":"crossref","unstructured":"Puzis, R., Elovici, Y. and Dolev, S. (2007b), \u201cFast algorithm for successive computation of Group Betweenness Centrality\u201d, Physical Review E, Vol. 76 No. 5, p. 056709.","DOI":"10.1103\/PhysRevE.76.056709"},{"key":"key2021010422431720600_b30","doi-asserted-by":"crossref","unstructured":"Raymond, J.F. (2001), \u201cTraffic analysis: protocols, attacks, design issues and open problems\u201d, in Federrath, H. (Ed.), Proceedings of International Workshop on Design Issues in Anonymity and Unobservability, LNCS 2009, Springer\u2010Verlag, Berlin, pp. 10\u201029.","DOI":"10.1007\/3-540-44702-4_2"},{"key":"key2021010422431720600_b31","unstructured":"Reiter, M.K. and Rubin, A.D. (1998), \u201cCrowds: anonymity for web transactions\u201d, ACM Transactions on Information and System Security, Vol. 1 No. 1, pp. 66\u201092."},{"key":"key2021010422431720600_b32","unstructured":"Reiter, M.K. and Rubin, A.D. (1999), \u201cAnonymous web transactions with crowds\u201d, Communications of the ACM, Vol. 42 No. 2, pp. 66\u201092."},{"key":"key2021010422431720600_b33","unstructured":"Serjantov, A. and Danezis, G. (2002), \u201cTowards an information theoretic metric for anonymity\u201d, in Dingledine, R. and Syverson, P. (Eds), Designing Privacy Enhancing Technologies, LNCS 2009, Springer\u2010Verlag, Berlin and Heidelberg, pp. 41\u201053."},{"key":"key2021010422431720600_b34","unstructured":"Shapira, B., Elovici, Y., Mashiach, A. and Kuplik, T. (2005), \u201cPRAW \u2013 a new model for PRivAte Web navigation\u201d, Journal of the American Society of Information Science Technology, Vol. 56 No. 2, pp. 159\u201072."},{"key":"key2021010422431720600_b35","unstructured":"Shields, C. and Levine, B.N. (2000), \u201cA protocol for anonymous communication over the internet\u201d, ACM Conference on Computer and Communications Security, pp. 33\u201042."},{"key":"key2021010422431720600_b36","unstructured":"Shields, C. and Levine, B.N. (2002), \u201cHordes: a protocol for anonymous communication over the Internet\u201d, ACM Journal of Computer Security, Vol. 10 No. 3, pp. 213\u201040."},{"key":"key2021010422431720600_b37","unstructured":"Shmatikov, V. and Wang, M. (2007), \u201cSecurity against probe\u2010response attacks in collaborative intrusion detection\u201d, Proceedings of the 2007 Workshop on Large Scale Attack Defense, LSAD 2007, Vol. 2007, p. 2007."},{"key":"key2021010422431720600_b38","unstructured":"Song, R. and Korba, L. (2002), \u201cReview of network\u2010based approaches for privacy\u201d, Proceedings of the 14th Annual Canadian Information Technology Security Symposium, Ottawa, pp. 1\u201010."},{"key":"key2021010422431720600_b39","unstructured":"Strogatz, S.H. (2001), \u201cExploring complex networks\u201d, Nature, No. 410, pp. 268\u201076."},{"key":"key2021010422431720600_b40","unstructured":"Vazquez, A., Pastor\u2010Satorras, R. and Vespignani, A. (2002), \u201cLarge\u2010scale topological and dynamical properties of Internet\u201d, Physical Review E, Vol. 65 No. 066130, available at: http:\/\/arXiv.org\/abs\/cond\u2010mat\/0112400."},{"key":"key2021010422431720600_b41","doi-asserted-by":"crossref","unstructured":"Wasserman, S. and Faust, K. (1994), Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge.","DOI":"10.1017\/CBO9780511815478"},{"key":"key2021010422431720600_b42","unstructured":"West, D.B. (2001), Introduction to Graph Theory \u2013 Second Edition, Prentice\u2010Hall, Upper Saddle River, NJ."},{"key":"key2021010422431720600_b43","unstructured":"Yagil, D. (2005), \u201cCollaborative attack on WWW users' anonymity\u201d, master's thesis, Department of Information Systems Engineering, Ben\u2010Gurion University, Beer Sheva."},{"key":"key2021010422431720600_b44","unstructured":"Yan, G., Zhou, T., Hu, B., Fu, Z.\u2010Q. and Wang, B.\u2010H. (2006), \u201cEfficient routing on complex networks\u201d, Physical Review E, Vol. 73 No. 046108."},{"key":"key2021010422431720600_b45","unstructured":"Yegneswaran, V., Barford, P. and Jha, S. (2004), \u201cGlobal intrusion detection in the DOMINO overlay system\u201d, Proceedings of Network and Distributed System Security Symposium NDSS 2004."}],"container-title":["Internet Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/10662240910927821","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240910927821\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240910927821\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:40:21Z","timestamp":1753400421000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/intr\/article\/19\/1\/60-77\/178827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,30]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1,30]]}},"alternative-id":["10.1108\/10662240910927821"],"URL":"https:\/\/doi.org\/10.1108\/10662240910927821","relation":{},"ISSN":["1066-2243"],"issn-type":[{"type":"print","value":"1066-2243"}],"subject":[],"published":{"date-parts":[[2009,1,30]]}}}