Path tracing in TOR networks

Nick Johnson*, Steve McLaughlin, John Thompson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


Internet based communications methods use channels which cross many nodes in their routes between source and destination. The user often has little or no control in the routing process and may be concerned that the medium is insecure. To combat this, privacy preserving networks have been developed in an attempt to allow secure, private internet-based communication. Whilst these networks employ high levels of encryption between nodes, it is possible to track a users data by correlating input and output streams. This paper addresses the implementation of the algorithmfirst proposed by Danezis for determining the exit node of data injected into a privacy preserving network, such as Tor. The algorithm is discussed along with some modifications and assumptions necessary for implementation. Results gained from applying the algorithm to data from a real Tor network are presented and discussed.

Original languageEnglish
Title of host publication2010 18th European Signal Processing Conference
Number of pages5
Publication statusPublished - 2010
Event18th European Signal Processing Conference 2010 - Aalborg, Denmark
Duration: 23 Aug 201027 Aug 2010

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491


Conference18th European Signal Processing Conference 2010
Abbreviated titleEUSIPCO 2010

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Path tracing in TOR networks'. Together they form a unique fingerprint.

Cite this