Collaborative attack on Internet users' anonymity

Author:

Puzis Rami,Yagil Dana,Elovici Yuval,Braha Dan

Abstract

PurposeThe 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.Design/methodology/approachThe 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.FindingsThe 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.Research limitations/implicationsIt 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.Practical implicationsThe 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.Originality/valueThe 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‐trivial Group Betweenness optimization strategy in large complex networks.

Publisher

Emerald

Subject

Economics and Econometrics,Sociology and Political Science,Communication

Reference45 articles.

1. Barabási, A.‐L. and Albert, R. (1999), “Emergence of scaling in random networks”, Science, No. 286, pp. 509‐12, available at: http://arXiv.org/abs/cond‐mat/9910332.

2. Barabási, A.‐L., Albert, R. and Jeong, H. (2000), “Scale‐free characteristics of random networks: the topology of the world‐wide web”, Physica A, No. 281, pp. 69‐77.

3. Barthélemy, M. (2004), “Betweenness centrality in large complex networks”, European Physical Journal B, Vol. 38 No. 2, pp. 163‐8.

4. Berthold, O., Federrath, H. and Köhntopp, M. (2000), “Project anonymity and unobservability in the Internet”, Proceedings of the Tenth Conference on Computers, Freedom and Privacy: Challenging the Assumptions, pp. 57‐68.

5. Bethencourt, J., Franklin, J. and Vernon, M. (2005), “Mapping internet sensors with probe response attacks”, Proceedings of the 14th Conference on USENIX Security Symposium, Berkeley, CA, Vol. 14, p. 13.

Cited by 24 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3