Abstract
Considering that access to information is one of the most important aspects of modern society, the actions of certain governments or internet providers to control or, even worse, deny access for their citizens/users to selected data sources has lead to the implementation of new communication protocols. TOR is such a protocol, in which the path between the original source and destination is randomly generated using a network of globally connected routers and, by doing so, the client is not identified as actually accessing the resource. However, if the ISP knows that the first hop is part of TOR or if it can identify the contents of the exchanged packages as being TOR packages, by using advanced detection algorithms, it can still perform it’s denial policies. These types of detection are circumvented by the usage of bridges (TOR routers which aren’t publicly known) and pluggable transports (content changing protocols, in order to pass through as innocent-looking traffic). The development of a didactic pluggable transport in a simulated TOR network is the main purpose of this paper, in order to investigate the current state of the art of TOR development and analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xin, L., Neng, W.: Design improvement for TOR against low-cost traffic attack and low-resource routing attack privacy enhancing technologies. In: International Conference on Communications and Mobile Computing (2009)
Dingledine, R., Mathewson, N., Syverson, P.: TOR: the second-generation onion router. Information Security Research Group (2014)
Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of TOR. In: IEEE Symposium on Security and Privacy (2005)
Murdoch, S.J.: Covert channel vulnerabilities in anonymity systems. Technical report (2007)
AlSabah, M., Goldberg, I.: Performance and security improvements for TOR: a survey. In: International Association for Cryptologic Research (2015)
Mittal, P., Olumofin, F.: PIR-TOR: scalable anonymous communication using private information retrieval. USENIX Security (2014)
Ghosh, M., Richardson, M.: A TorPath to TorCoin: proof-of-bandwidth altcoins for compensating relays. USENIX Security (2011)
Dyer, K.P, Coull, S.E., Ristenpart, T., Shrimpton, T.: Protocol misidentification made easy with format-transforming encryption. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 61–72. ACM (2013)
Fifield, D., Hardison, N., Ellithorpe, J., Stark, E., Boneh, D., Dingledine, R., Porras, P.: Evading censorship with browser-based proxies. In: Fischer-Hübner, S., Wright, M. (eds.) PETS 2012. LNCS, vol. 7384, pp. 239–258. Springer, Heidelberg (2012)
Winter, P., Pulls, T., Fuss, J.: ScrambleSuit: a polymorphic network protocol to circumvent censorship. In: Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society, pp. 213–224. ACM (2013)
Mohajeri Moghaddam, M., Li, B., Derakhshani, M., Goldberg, I.S.: protocol obfuscation for TOR bridges. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 97–108. ACM (2012)
TOR Project - Pluggable Transports. https://www.torproject.org/docs/pluggable-transports.html.en
Acknowledgments
This work partially supported by the Romanian National Authority for Scientific Research (CNCSUEFISCDI) under the project PN-II-PT-PCCA-2013-4-1651.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Panait, IC., Pop, C., Sirbu, A., Vidovici, A., Simion, E. (2016). TOR - Didactic Pluggable Transport. In: Bica, I., Reyhanitabar, R. (eds) Innovative Security Solutions for Information Technology and Communications. SECITC 2016. Lecture Notes in Computer Science(), vol 10006. Springer, Cham. https://doi.org/10.1007/978-3-319-47238-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-47238-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47237-9
Online ISBN: 978-3-319-47238-6
eBook Packages: Computer ScienceComputer Science (R0)