1
Master of Computer Science, Shahid Beheshti University, Tehran, Iran.
2
Master's degree in secure communication and cryptography, University of Science and Technology, Tehran, Iran.
Abstract
Tor is one of the most popular networks providing anonymity and privacy on the Internet that works using volunteer systems from around the world. Low latency operation makes it suitable for things like web browsing. The way to select a path in tor network is one of the influential factors in the efficiency and security of this network. The path selection algorithm in the tor network has undergone many changes over its original design. These changes have been made for reasons such as increased efficiency, reliability, and load balancing, sometimes even in response to introduced attacks, they have to change the path selection algorithm. So far, many papers have looked at how to choose relays in the creation of circuits, but none of them, despite the open-source of the tor code, did not analyze the routing algorithm and the weighting method of the relays. And they have not proved logically and mathematically the relations used in this algorithm. In this paper, we attempt after fully analyzing the tor routing algorithm, for the first time, the exact logical and mathematical proofs of the relationships used in this algorithm are discussed. In this paper, we tried to investigate the anonymous network routing algorithm as the largest current anonymous network in the world.
Dingledine, N. Mathewson, and P. Syverson, "TOR: The second generation onion router", In Proceedings of the Usenix Security Symposium, 2004.
Loesing, S. Murdoch, and R. Dingledine, "A Case Study on Measuring Statistical Data in the Tor Anonymity Network", In Proceedings of Financial Cryptography and Data Security, 2010.Overlier and P. Syverson, "Locating hidden
servers", In Proceedings of the 27th IEEE Symposium on Security and Privacy, pp. 100-114, 2006.DOI: 1109/SP.2006.24
Bauer, D. McCoy, D. Grunwald, T. Kohno, and D. Sicker,"Low-resource routing attacks against anonymous systems",In Proceedings of the 2007 Workshop on Privacy in the Elec-tronic Society (WPES), 2007.
Douceur, "The Sybil Attack", In Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS), 2002.
Johnson, P. F. Syverson, R. Dingledine, and N. Mathewson,"Trust-based anonymous communication: adversary models and routing algorithms", In ACM CCS, 2011.
Sassone, E. ElSalamouny, and S. Hamadou, "Trust in crowds: Probabilistic behaviour in anonymity protocols", In Symposium on Trustworthy Global Computing, TGC. Springer Lecture Notes on Computer Science 88–102, 2010.
Johnson, and P. Syverson, "More anonymous onion routing through trust", In IEEE Computer Security Foundations Symposium, 2009.
Edman, and P. Syverson, "As-awareness in tor path selection", In ACM CCS, 2009.
Feamster, and R. Dingledine, "Location diversity in anonymity Networks", In ACM Workshop on Privacy in the Electronic Society, Washington, DC, 2004.
Panchenko, J. Renner, "Path Selection Metrics for Performance-Improved Onion Routing", Proceedings of the Ninth Annual International Symposium on Applications and the Internet, pp. 114-120, 2009.DOI: 10.1109/SAINT.2009.26
Akhoondi, C. Yu, and H. Madhyastha, "LASTor: A Low-Latency AS-Aware Tor Client", In Proceedings of the 2012 IEEE Symposium on Security and Privacy, pp. 476–490, 2012.DOI: 10.1109/SP.2012.35
)
