DocumentCode :
1977066
Title :
Analysis on end-to-end node selection probability in Tor network
Author :
Dahal, Saurav ; Junghee Lee ; Jungmin Kang ; Seokjoo Shin
Author_Institution :
Dept. of Comput. Eng., Chosun Univ., Gwangju, South Korea
fYear :
2015
fDate :
12-14 Jan. 2015
Firstpage :
46
Lastpage :
50
Abstract :
Tor is an open network that helps to defend against traffic analysis and thus achieves anonymity and resisting censorship online. Nowadays many researches have been carried out to attack Tor and to break the anonymity. To deanonymize the Tor, the attacker must be able to control both the guard node and exit node of a circuit. In this paper, we present an analysis on end-to-end node selection probability when an attacker adds different types of compromised nodes in the existing Tor network. For accurate Tor simulation, we used Shadow simulator for our experiment. By extensive performance evaluation, we conclude that when guard + exit flagged compromised nodes are added to Tor network, the selection probability of compromised nodes gets higher.
Keywords :
computer network security; probability; telecommunication network routing; Shadow simulator; Tor network; Tor simulation; compromised nodes; end-to-end node selection probability; online anonymity; online censorship resistance; open network; selection probability; traffic analysis; Bandwidth; Peer-to-peer computing; Privacy; Relays; Routing; Security; Servers; Shadow; Tor; nodes; selection probability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Networking (ICOIN), 2015 International Conference on
Conference_Location :
Cambodia
Type :
conf
DOI :
10.1109/ICOIN.2015.7057855
Filename :
7057855
Link To Document :
بازگشت