Spatial Path Selection and Network Topology Optimisation in P2P Anonymous Routing Protocols

Authors

  • Aleksandar Tošic University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia, and InnoRenew CoE, Izola, Slovenia
  • Jernej Vičič University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia and Research Centre of the Slovenian Academy of Sciences and Arts, The Fran Ramovš Institute, Ljubljana, Slovenia

DOI:

https://doi.org/10.13052/jwe1540-9589.2115

Keywords:

Lokinet, anonymous routing protocol, geo-sharding, fault tolerance, oxen

Abstract

To anonymous internet traffic, many popular protocols route traffic through a network of nodes in order to conceal information about the request. However, routing traffic through other nodes inherently introduces added latency. Over the past two decades, there were many attempts to improve the path selection in order to decrease latency with little or no trade-off in terms of security, and anonymity. In this paper, we show the potential use of geo-sharding in decentralized routing networks to improve fault-tolerance, and latency. Such networks can be used as a communication layer for Edge devices computing huge amounts of data. Specifically, we focus our work on Low Latency Anonymous Routing Protocol (LLARP), a protocol built on top of Oxen blockchain that aims to achieve internet privacy. We analyse the existing network of Service Nodes(SN), observe cloud provider centralisation, and propose a high level protocol that provides incentives for a better geographical distribution mitigating potential cloud provider/country wide service dropouts. Additionally, the protocol level information about geographical location can be used to improve client’s path (the string of nodes that will participate in the transaction) selection, decreasing network latency. We show the feasibility of our approach by comparing it with the random path selection in a simulated environment. We observe marginal drops in average latency when selecting paths geographically closer to each other.

Downloads

Download data is not yet available.

Author Biographies

Aleksandar Tošic, University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia, and InnoRenew CoE, Izola, Slovenia

Aleksandar Tošić. PhD candidate, teaching, and research assistant at University of Primorska, and Innorenew CoE. His fields of research are distributed, and decentralized systems, Peer to Peer networks, and distributed ledger technologies.

Jernej Vičič, University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia and Research Centre of the Slovenian Academy of Sciences and Arts, The Fran Ramovš Institute, Ljubljana, Slovenia

Jernej Vičič. Associate professor and research associate at the University of Primorska and Research Centre of the Slovenian Academy of Sciences and Arts. His research interests are quite broad ranging from language technologies to distributed systems.

References

Masoud Akhoondi, Curtis Yu, and Harsha V. Madhyastha. Lastor: A low-latency as-aware tor client. In 2012 IEEE Symposium on Security and Privacy, pages 476–490. IEEE, 2012.

Nasser Mohammed Al-Fannah. One leak will sink a ship: WebRTC IP address leaks. In 2017 International Carnahan Conference on Security Technology (ICCST), pages 1–5. IEEE, 2017.

Aiiad Albeshri, Colin Boyd, and Juan Gonzalez Nieto. Geoproof: Proofs of geographic location for cloud computing environment. In 2012 32nd International Conference on Distributed Computing Systems Workshops, pages 506–514. IEEE, 2012.

Kevin Bauer, Damon McCoy, Dirk Grunwald, Tadayoshi Kohno, and Douglas Sicker. Low-resource routing attacks against tor. In Proceedings of the 2007 ACM workshop on Privacy in electronic society, pages 11–20, 2007.

Stefan Brands and David Chaum. Distance-bounding protocols. In Workshop on the Theory and Application of of Cryptographic Techniques, pages 344–359. Springer, 1993.

David L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24(2):84–90, February 1981.

Primavera De Filippi and Smari McCarthy. Cloud computing: Centralization and data sovereignty. European Journal of Law and Technology, 3(2), 2012.

Maxence Delong, Eric Filiol, Clément Coddet, Olivier Fatou, and Clément Suhard. Osint analysis of the tor foundation. arXiv preprint arXiv:1803.05201, 2018.

John R Douceur. The sybil attack. In International workshop on peer-to-peer systems, pages 251–260. Springer, 2002.

Bamba Gueye, Artur Ziviani, Mark Crovella, and Serge Fdida. Constraint-based geolocation of internet hosts. IEEE/ACM Transactions On Networking, 14(6):1219–1232, 2006.

Paul T Jaeger, Jimmy Lin, Justin M Grimes, and Shannon N Simmons. Where is the cloud? geography, economics, environment, and jurisdiction in cloud computing. First Monday, 2009.

Kee Jefferys, Simon Harman, Johnathan Ross, and Paul McLean. Private transactions, decentralised communication. Technical report, OPTF, 2018.

Wenting Li, Sébastien Andreina, Jens-Matthias Bohli, and Ghassan Karame. Securing proof-of-stake blockchain protocols. In Data Privacy Management, Cryptocurrencies and Blockchain Technology, pages 297–315. Springer, 2017.

Jon McLachlan and Nicholas Hopper. On the risks of serving whenever you surf: Vulnerabilities in tor’s blocking resistance design. In Proceedings of the 8th ACM workshop on Privacy in the electronic society, pages 31–40, 2009.

Guy M Morton. A computer oriented geodetic data base and a new technique in file sequencing. Technical report, International Business Machines Company New York, 1966.

Steven J Murdoch and George Danezis. Low-cost traffic analysis of tor. In 2005 IEEE Symposium on Security and Privacy (S&P’05), pages 183–195. IEEE, 2005.

Gustavo Niemeyer. Labix blog. https://web.archive.org/web/20080305223755/http://blog.labix.org/#post-85. Accessed: 2021-4-22.

Andriy Panchenko and Johannes Renner. Path selection metrics for performance-improved onion routing. In 2009 Ninth Annual International Symposium on Applications and the Internet, pages 114–120. IEEE, 2009.

I2P Project. Garlic routing and “garlic” terminology. Technical report, I2P Project, 2014. Accessed: 2021-1-9.

Tor Project. Possible upcoming attempts to disable the tor network. Technical report, The Tor Project, 2014. Accessed: 2021-1-9.

Eric Sven Ristad and Peter N Yianilos. Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(5):522–532, 1998.

Stephen Rollyson. Improving tor onion routing client latency. Georgia Tech College of Computing, Tech. Rep, 2006.

Fatemeh Shirazi, Milivoj Simeonovski, Muhammad Rizwan Asghar, Michael Backes, and Claudia Diaz. A survey on routing in anonymous communication protocols. ACM Computing Surveys (CSUR), 51(3):1–39, 2018.

Robin Snader and Nikita Borisov. Improving security and performance in the tor network through tunable path selection. IEEE Transactions on Dependable and Secure Computing, 8(5):728–741, 2010.

Helger Lipmaa UT, Michał Zając UT, Claudia Diaz KUL, Tariq Elahi KUL, Benjamin Weggenmann SAP, and Aggelos Kiayias. Design, modelling and analysis. Technical report, European Commision, 2016.

Rungrat Wiangsripanawan, Willy Susilo, and Reihaneh Safavi-Naini. Design principles for low latency anonymous network systems secure against timing attacks. Physical Sciences and Mathematics Commons, pages 1–11, 2007.

Philipp Winter, Roya Ensafi, Karsten Loesing, and Nick Feamster. Identifying and characterizing sybils in the tor network. In 25th {USENIX} Security Symposium ({USENIX} Security 16), pages 1169–1185, 2016.

Downloads

Published

2021-11-28

Issue

Section

Articles