<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Darknet Security: A Categorization of Attacks to the Tor Network</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Enrico Cambiaso</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Vaccari</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Patti</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Aiello</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Consiglio Nazionale delle Ricerche (CNR-IEIIT)</institution>
          ,
          <addr-line>Genoa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the darknet security topic, it is important to analyze the threats that characterize the network. This paper deeply investigates the literature of attacks against the Tor network, presenting the most relevant threats in this context. In order to provide an important tool for the research community, we propose an exhaustive taxonomy based on the target of the attack. Such taxonomy represents a characterization scheme to identify cyber-attacks related to darknet environments and better understand their functioning. The proposed work should therefore be considered an important step forward in the darknet security eld.</p>
      </abstract>
      <kwd-group>
        <kwd>darknet cyber-security tor onion network taxonomy</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In the communication era, the global Internet network represents a fundamental
resource for everyday live. Security aspects on the Internet assume today a very
important role [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]: being a crucial element for users activities, governments, and
critical infrastructure systems, the Internet network has to be kept a safe place
for its users and inter-communicating systems, ensuring secure communications
and guaranteeing users rights. In the privacy context, it is important to ensure
hiding capabilities for both the content exchanged between two entities and the
identity of the entities themselves [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        Anonymity network systems were primarily designed to preserve
communications privacy to censored Internet users. Anonymity is achieved by embedding
user data inside of di erent layers of encryption and by forwarding the tra c
through a set of relay/routing nodes or proxies [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Onion networks [
        <xref ref-type="bibr" rid="ref2 ref4">2, 4</xref>
        ]
represent today one of the available solutions adopted in this context. Such networks
are based on onion routing approaches, involving encryption procedures making
routing nodes unable to read exchanged data between two (client and server)
entities. There exist several di erent anonymizing networks [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], such as Freenet [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
I2P [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], MorphMix [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Hornet [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] or Tarzan [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Nevertheless, nowadays,
the most adopted onion network is Tor [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Representing the second version of the original Onion Routing protocol [
        <xref ref-type="bibr" rid="ref2 ref4">2,
4</xref>
        ], the Tor network (Tor in the following) is today considered one of the most
popular network protocol for anonymous communications. Developed starting
from an internal project of the United States Naval Research Lab, hence
inherited by the Tor non-pro t organization in late 2003, Tor was created to improve
privacy and security of Internet users. Tor rapidly acquired adoption on the
Internet: while on January 2010, about 1,000 Tor public relays was distributed
around the world, this number quickly raised to nearly 8,000 on January 2015,
and is nowadays stabilized to around 7,000 nodes. In virtue of its e ectiveness,
the anonymity levels provided by Tor are often uncomfortable to law
enforcement or governments prone to Internet censorship activities. This statement is
con rmed by a July 2014 competition organized by the Russian government,
giving a 110,000 USD price to any Russian citizen breaking the Tor network for
tracking purposes 1.
      </p>
      <p>
        Due to the adoption of the Tor network and the nature of exchanged contents,
it is important to deeply explore the network, its functioning and the associated
weaknesses, in the darknet security context. In this paper, we analyze
cyberattacks on the Tor network, by proposing an exhausting taxonomy of available
attacks, by analyzing the target of the attack. Although other works propose a
survey of Tor attacks [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the proposed work reports a broader set of threats,
also proposing a categorization of them. Particularly, we report the functioning
of the Tor network in Section 2, hence categorizing and describing available
attacks in Section 3. Section 4 reports instead considerations on the analyzed
attacks, while, nally, Section 5 reports the conclusions of the work.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>The Tor Protocol</title>
      <p>
        Tor can be adopted in order to hide the identity of the client while sur ng on
the surface web (including websites reachable through a common browser) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
or while accessing hidden services on the Tor network [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Considering the rst
scenario, accordingly to Figure 1, each communication involves several public
relay nodes: (i) the client, (ii) the server, (iii) a Tor entry node (or guard node),
(iv) a Tor exit node, and (v) a set of Tor middle nodes greater or equal to one.
Since a single middle node is usually adopted [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] (as depicted in Figure 1), we
will consider such scenario in the following.
1 "Putin Sets $110,000 Bounty for Cracking Tor as Anonymous InternetUsage in
Russia Surges" (Accessed on Nov 6th, 2018):
http:www.bloomberg.comnews201407-29putin-sets-110-000-bounty-for-cracking-tor-as-anonymous-internet-usage-inrussia-surges.html
      </p>
      <p>
        Tor also supports additional guard nodes known as bridge nodes [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]: unlike
public relay nodes, in this case the identity/IP address of the node is not public.
Also, the Tor network can be extended by any host wishing to become part of the
network. Although this characteristic makes Tor an extremely scalable network,
it also makes it vulnerable by design to man-in-the-middle attacks, especially in
case a malicious user controls the exit node of the network and communications
with the server are not encrypted [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        The set of Tor nodes involved in the communication is chosen by the client
itself and it represents a Tor circuit, build by the client at the begin of the
connection by communicating with the network nodes belonging to the circuit and
exchanging a separate encryption key with each node. Messages are encrypted by
the client through an onion encryption scheme [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Since each node involved in
the communication is the only one able to decrypt the message it receives, each
node is only aware of the identity of its predecessor and successor on the circuit.
In addition, while the entry/guard node is the only one directly communicating
with the client, only the exit node is able to read the original message (to be
delivered to the server on the surface Internet network), that can be encrypted
if encryption algorithms are adopted (such as SSL).
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Attacks to the Tor ecosystem</title>
      <p>During the years, several studies have been conducted on onion networks [2,
18{20], with particular focus on the Tor network, that is the most adopted one.
Considering onion networks security, attacks may target three di erent entities
of the network:
{ Client: in this case, the aim of the attacker is to target a client of the Tor
network;
{ Server: in this case, the Tor hidden server is targeted by the attacker;
{ Network: in this case, the Tor network itself is targeted by the attacker.
Concerning such di erent entities, we now describe available attacks, by
focusing on the Tor onion network. We also analyze attacks targeting generic/mixed
entities.
3.1</p>
      <sec id="sec-3-1">
        <title>Attacks to the client</title>
        <p>
          Several studies have been conducted during the years in order to hack the Tor
network and de-anonymize its users, associating their IP address to an outgoing
packet [
          <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
          ]. These studies often led to concrete attacks exploiting speci c
vulnerabilities, removed by Tor developers through appropriate updates of the
browser software. In this part of the paper we report attacks aimed at creating
a damage to the Tor client.
        </p>
        <p>
          Plug-in based attacks These attacks are executed to target the user through the
Internet browser he adopts to navigate on the network. Such threats make use
of external software plugged into the browser (plug-in), such as Flash, Java, and
ActiveX Controls [23, ?]. These applications run as separate software, executed
with users permissions on the operating system. Some of these technologies, like
Java or Adobe Flash, for instance, are executed in apposite virtual machines or
frameworks bypassing proxy con guration settings adopted by the Tor browser,
hence directly communicating on the Internet network, without making use of
the Tor ecosystem. Browser attacks may be implemented by following di erent
approaches [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]: (i) by operating on the public Internet server contacted by the
client, through a malicious server system embedding, for instance, Adobe Flash
contents on the web page; (ii) by adopting an evil exit node, intercepting users
communications on not encrypted channels (e.g. clear HTTP connections) and
embedding malicious plug-in related contents. Due to the possible exposure of
the clients identity deriving from the usage of browser plug-ins, as suggested by
anonymizing browsers themselves, such technologies, often disabled by default,
should be avoided in order to communicate on the onion network anonymously
and safely.
        </p>
        <p>
          Torben attack The Torben attack [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] is executed to identify a Tor client, by
manipulating web pages to force the user to access content from untrusted sources
and by exploiting low-latency characteristics of anonymization networks to infer
indicators of web pages that are transmitted, hence retrieving information on
the web pages the client visits through Tor.
        </p>
        <p>
          P2P Information leakage This kind of attack is perpetrated in order to
deanonymize Tor clients by exploiting their connections to peer-to-peer systems.
Indeed, considering for instance the BitTorrent protocol [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], it is possible for
a malicious user to retrieve the IP address of a client connecting over Tor to
communicate with the torrent tracker. A torrent tracker is a network service the
client has to communicate to retrieve information about the list of peers able to
share the requested resource [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Peers information are provided as couples of
IP address and listening port.
        </p>
        <p>
          The attacker exploits in this case the fact that, although the list of trackers
may be retrieved anonymously via Tor, P2P connections are often accomplished
unsafely, by directly communicating with the peer. Therefore, it is possible for
the attacker to exploit the man-in-the-middle addiction of the Tor network to
alter the content of the list returned by the torrent tracker, by including into
the list the IP address of a malicious torrent peer. Since communication with
such peer would not be established through Tor, it is possible for the attacker to
retrieve the IP address of the client originating the request to the tracker [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
Induced Tor guard selection The Tor entry node is the only node directly
communicating with the client. Nevertheless, since Tor packets payload is encrypted,
it is not possible for the entry node to retrieve the clean content of exchanged
messages without knowing the decryption keys of the circuit nodes. Therefore,
although a single malicious guard node may not compromise the communication,
it may be required to the attacker to own the entry node of a Tor circuit [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>
          In order to induce a Tor client to adopt a speci c malicious entry node, it
is possible to drop communications of the client to public entry nodes, except
the attackers ones [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. This operation can be accomplished, for instance, by
altering tra c capabilities of the victim, blocking connections to legitimate entry
nodes at the network level through appropriate policies, de ned, e.g., by network
administrators or local Internet Service Providers.
        </p>
        <p>
          Raptor Routing attacks on privacy in Tor (RAPTOR) [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] is a suite of attacks
that can be launched by the Autonomous System (AS) [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] to deanonymize
clients. One of the attacks is based on tra c analysis of asymmetric
communications that characterize the network. Another attack exploits the natural churn
in Internet routing and BGP paths to accomplish tra c analysis. Finally, the
last attack is based on Internet routing manipulation through BGP hijacking
activities, accomplished to discover users' Tor guard nodes.
        </p>
        <p>
          Unpopular ports exploitation This attack exploits the fact Tor exit nodes often
limit the range of ports they can connect to on the public surface Internet [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
The attack attempts to retrieve clients identity by making use of a set of
malicious entry nodes and a set of malicious exit nodes. Exit nodes controlled by
the attacker support communications on unpopular ports. It is also required to
the attacker to control the service host contacted by the client [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The attacker
aim is to induce the client to create a Tor circuit through an entry node and
an exit node under the control of the malicious user. Such con guration would
allow the attacker to retrieve the identity of the Tor client, for instance through
tra c correlation techniques [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ].
        </p>
        <p>In order to perpetrate the attack, the malicious user injects a script into
the web page requested by the client, thus inducing the browser to open a
connection to an Internet service listening on unpopular port. Such connection is
established through the Tor network. This behaviour will induce the client to
create a Tor circuit allowing communication on the speci ed unpopular port.
Since the attacker controls a set of exit nodes supporting such communication,
the probability to control the exit node of the circuit increases.</p>
        <p>
          Low-resource routing attacks In order to perpetrate such attack, the adversary
has to enroll or compromise some high-bandwidth, high-uptime Tor routers [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
By assuming such compromising, the attacker can decrease the resource
requirements of the malicious node, by using low-bandwidth connections, hence
exploiting the possibility of a node to report incorrect bandwidth values. Since
this advertisement is not veri ed by trusted directory servers [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], the relay
node appears to have a high-bandwidth and its chance to be chosen for a circuit
is particularly high2. In case both the entry and the exit nodes in a circuit are
2 Currently, this approached is no longer possible to adopt, since directory servers
control the e ective bandwidth declared.
compromised, all information received may be logged and processed, for instance
through tra c correlation approaches, to reveal the IP address of the client.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Attacks to the server</title>
        <p>
          In this kind of threats, the purpose of the attacker is to target the hidden service,
in order to reveal its identity or to weaken it. Indeed, as previously mentioned,
the Tor network can be adopted in order to access services both on the public
surface Internet and Tor (hidden services). In the latter case, the identity of
the service is unknown to the client [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Concerning attacks whose purpose is to
reveal the hidden service IP address, the following assumptions may be required
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]: (i) the attacker has to impersonate a malicious client and a guard node;
(ii) the hidden service is forced to choose a compromised guard node as entry
node. Di erent attacks to hidden services are available.
        </p>
        <p>
          Cell counting and padding During such attacks [
          <xref ref-type="bibr" rid="ref12 ref30">12, 30</xref>
          ], the hidden service is
forced to establish a connection to a malicious rendezvous point. The attacker
sends a speci cally crafted Tor cell/packet to the introduction point of the hidden
service, specifying the chosen rendezvous point [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ]. Hence, the introduction
point forwards the message to the hidden service, that is induced to build a Tor
circuit to reach the (malicious) rendezvous point. When the rendezvous point
receives the message (containing some sort of cookie/token generated from the
client), it is designed to send a speci c number (50) of padding cells to the hidden
service, by using the same circuit. Such padding cells, supported by the protocol
and discarded by the hidden service, simpli es the generation of a signatures on
the tra c [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. At this point, the rendezvous point terminates/closes the circuit.
The entry node, supposed to be controlled by the attacker, monitors the tra c
of the circuits that pass through it. If it receives a cell including the circuit
closure, it will verify that such reception occurs after the reception of the cell
containing the con rmation cookies, and that the number of past cells is 3 cells
up through the circuit and 53 down through the circuit. If these conditions are
met, the attacker can deduce that the guard node he owns was chosen from the
hidden service, hence, it is possible for the attacker to retrieve the IP address of
the hidden service.
        </p>
        <p>
          Tor cells manipulation By manipulating Tor cells/packets it is possible to
locate a targeted hidden service [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Particularly, when the client sends a cell to a
hidden service to initiate the communication, the request is "proxed" by the
rendezvous point, that is assumed to be controlled by the attacker. Such condition
provides to the malicious user the ability to detect the request and apply minor
changes to the message/cell data (even a single bit may be changed, hence
making the cell not compliant to the protocol), thus forwarding the message to the
hidden service and simultaneously sending a timestamp of the modi ed cell to a
central server under the control of the attacker. The cell may not be recognized
as an intact cell from the hidden service, that would send back a destroy message
to the client. This message, directed from hidden service to the client, is designed
to pass from hidden services entry node (controlled by the attacker) rst, that
may send to the central server some cells information like the command speci ed
on the cell (CELL DESTROY), the cell timestamp, the circuit ID and the source IP
address. At this point, the cell is designed to reach the rendezvous point, which
may report the central server the timestamp of the cell before forwarding it to
the client. Finally, from the central server, through time correlation may nd
the IP address of the hidden service.
        </p>
        <p>
          Caronte attack Caronte [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] is a tool to automatically identify location leaks
in hidden services. Such information includes, i.e., sensitive data in the content
served by the hidden service or the con guration of the server, potentially able
to disclose the IP address of the hidden service. These location leaks are usually
introduced by the administrator of the hidden service and, in virtue of this, they
do not refer to some sort of vulnerability of Tor.
        </p>
        <p>
          O -path MitM This attack is based on the execution of a man-in-the-middle
(MitM) attack against a Tor hidden service [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. In particular, by assuming
the private key adopted by the hidden service to communicate on the network is
owned by the attacker, it is possible to accompish a MitM attack. The important
aspect in this case is that it is not required the attacker to be located in the
communication path between the client and the server.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Attacks to the network</title>
        <p>In this case, the target of the attack is the Tor network itself. By targeting the
entire network, it is important to consider that in this case, multiple nodes may
be a ected by the malicious activities. Hence, in this case, the attack e ects
may be propagated to the entire network, instead, for instance, to a ect a single
node.</p>
        <p>
          Bridge discovery In this case, the aim is to retrieve information on Tor bridge
nodes. Such information are not publicly available [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Two di erent bridge
discovery approaches are considered [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ]: from one side, it is possible to enumerate
Tor bridges through bulk emails and HTTPS servers over Tor. From the other
side, it is possible to adopt a malicious Tor middle router/node to exploit the
weighted bandwidth routing algorithms of Tor for bridge discovery purposes.
Denial of service Denial of service (DoS) attacks are executed to make a network
component or service not available on the network, or to reduce its availability.
A DoS attack against the Tor network is CellFlood [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. This attack exploits the
fact that adopting a private key to perform 1024-bit operations is, on modern
servers, about 20 time slower than performing the same operations with the
public key. Therefore, in order to process a Tor cell is 4 times longer/heavier,
compared to create it. This approach may lead a malicious client to ood a
targeted node with speci cally created cells, in order to seize all the computing
resources of the target, hence leading to a denial of service.
        </p>
        <p>
          Sniper The Sniper attack [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] exploits the ow control algorithm of Tor, by
executing a DoS attack against a target Tor relay, killing the Tor process on
the machine. This is reached by forcing a node to bu er large amounts of data
(utilizing valid protocol messages) until it is overloaded and forced o ine. The
adversary can attacks a huge number of nodes to degrade network capabilities
and increase the chance for a client to choose an attacker's node. In the paper two
attacks are described: (i) the attacker stops reading from the TCP connection
containing the attack circuit, which causes the TCP window on the victim's
outgoing connection to close and the victim to bu er up to 1000 cells; (ii) the
attacker causes cells to be continuously sent to the victim (exceeding the 1000
cell limit and consuming the victim's memory resources), either by ignoring the
package window at packaging end of the circuit, or by continuously sending
SENDME messages3 from the delivery end to the packaging, end even though no
cells have been read by the delivery end.
3.4
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>Generic attacks</title>
        <p>
          Since attacks may not target a single Tor entity (client, server, network), in the
following we report a set of attacks designed to target multiple entities.
Tra c analysis attacks This kind of attacks is based on network tra c analysis
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. For this type of attack, packets are inserted server-side, trying to observe
these packets from client-side through a statistical correlation. The goal is to
derive the circuit established by the client and associate the client with the
observed packets from the exit node. It is assumed that the attacker is able to
observe the tra c that enters and leaves the Tor network through the nodes, at
various points. The proposed attack, tries to force the client to make a connection
to a malicious server, such that it is able to inject a speci c repetitive tra c in
the TCP connection. The attacker in possession of a great amount of entry
node, will observe tra c between various entry node and client, and then will
try to detect that speci c tra c entered by the malicious server. Once the tra c
is recognized, by statistical correlation, it is possible associate tra c with the
client, so obtaining Tor circuit used. In general, it has been proved that it is
possible to counter tra c analysis methods by employing mixing strategies [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ].
Timing attacks This attack represents a variant of tra c analysis attack
previously mentioned. Indeed, timing attacks [
          <xref ref-type="bibr" rid="ref24 ref36">24, 36</xref>
          ] try to obtain a relationship
between the client and the server, by observing exchanged packets to accomplish
temporal correlation. The attacker must in this case own both the entry and the
exit node of the victim's circuit. In this case, it is possible to associate packets
to a de ned client/server, through a temporal analysis, even though the
content of the packet is unknown or encrypted. Tra c may be actively temporarily
interrupted at prede ned intervals, in order to facilitate correlation. In order
3 A SENDME message speci es the exit node to increase its congestion window, hence
to continue to pull data from the external source and forward it into the Tor circuit.
to protect the nodes from this types of attacks, Tor nowadays embed packets
bu ering, delaying and shu ing approaches.
        </p>
        <p>
          It is also possible to combine the same approach to accomplish tra c analysis
[
          <xref ref-type="bibr" rid="ref37">37</xref>
          ]. In this case, by executing timing attacks on the tra c related to the victim
and adopting tra c analysis to accomplish bandwidth estimation, the attack is
able to infer the network identity of an anonymous client, hidden service, and
anonymizing proxies.
        </p>
        <p>
          Shaping attacks This attack represents a variation of the timing attack
previously described. While in case of timing attacks, tra c may be interrupted
for speci c periods, in this case, the attack actively alters the tra c shape to
facilitate correlation. By analyzing and comparing the shape, it is possible to
identify variations from the expectations [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] to compare di erent tra c ows
and correlate the tra c with higher con dence.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Considerations on available attacks</title>
      <p>Mentioned attacks are important threats to the Tor ecosystem and they can
be adopted by malicious users in order to retrieve information or to perpetrate
malicious activities. According to our categorization, Table 1 reports the targeted
entity of each attack.</p>
      <p>By exploiting network or protocol vulnerabilities, it is possible to target the
Tor network through di erent approaches and by targeting di erent entities of
the network.</p>
      <p>
        Instead, in order to identify and protect Tor, di erent research activities
focus on the adoption of machine learning approaches to identify running attacks
to the Tor network. In particular, neural networks may be adopted to
implement an Intrusion Detection System able to identify running threats [38, ?]. In
addition, machine learning algorithms and techniques may be employed to
identify whether a host is generating Tor related tra c, in order to detect possible
malware exploiting the underlying network [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ].
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and further work</title>
      <p>
        In this paper, we have investigated the darknet security topic, related to attacks
that are related to a darknet environments. By focusing on the Tor onion
network [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], we have deeply investigated the literature of cyber-attacks exploiting
such system. In order to provide a more easy to understand overview of the
threats against darknet environments, we have proposed an easy-to-understand
categorization of attacks against darknet environments, by also categorizing the
investigated threats. The proposed categorization should be considered an
important step in the darknet security context, since it provides an important tool
to classify threats, hence, to better understand them and to propose e cient
protection systems.
      </p>
      <p>Further work on the topic may be directed on the execution of the mentioned
threats on controlled environments. Also, additional work may be focused on the
investigation of detection and mitigation approaches able to counter the analyzed
threats, by proposing an appropriate taxonomy of protection systems.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgement</title>
      <p>This work has been supported by the following research projects: (i) Advanced
Networked Agents for Security and Trust Assessment in CPS/IoT Architectures
(ANASTACIA) project has received funding from the European Unions Horizon
2020 Research and Innovation Pro- gramme under Grant agreement no. 731558.
(ii) My Health-My Data (MHMD) project has received funding from the
European Unions Horizon 2020 Research and Innovation Programme under Grant
agreement no. 732907. (iii) Integrated Framework for Predictive and
Collaborative Security of Financial Infrastructures (FINSEC) project has received funding
from the European Unions Horizon 2020 Research and Innovation Programme
under Grant agreement no. 786727.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zeng</surname>
          </string-name>
          and W. Liu, \
          <article-title>Enhancing network robustness against malicious attacks," Physical Review E - Statistical</article-title>
          , Nonlinear, and Soft Matter Physics,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>D.</given-names>
            <surname>Goldschlag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Reed</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Syverson</surname>
          </string-name>
          , \
          <article-title>Onion routing for anonymous and private internet connections,"</article-title>
          <source>Network</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Sulaiman</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhioua</surname>
          </string-name>
          , \
          <article-title>Attacking tor through unpopular ports,"</article-title>
          <source>in Proceedings - International Conference on Distributed Computing Systems</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Murdoch</surname>
          </string-name>
          and G. Danezis, \
          <article-title>Low-cost tra c analysis of Tor,"</article-title>
          <source>in Proceedings - IEEE Symposium on Security and Privacy</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>K.</given-names>
            <surname>Bauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>McCoy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Grunwald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kohno</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Sicker</surname>
          </string-name>
          , \
          <article-title>Low-resource routing attacks against tor,"</article-title>
          <source>in Proceedings of the 2007 ACM workshop on Privacy in electronic society - WPES '07</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>I.</given-names>
            <surname>Clarke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. G.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. W.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Sandberg</surname>
          </string-name>
          , and B. Wiley, \
          <article-title>Protecting free expression online with freenet,"</article-title>
          <source>IEEE Internet Computing</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>B.</given-names>
            <surname>Zantout</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Haraty</surname>
          </string-name>
          , \
          <article-title>I2P data communication system,"</article-title>
          <source>in The Tenth International Conference on Networks</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>G. N.</given-names>
            <surname>Tchabe</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          , \
          <article-title>Anonymous Communications: A survey on I2P," tech. rep</article-title>
          .,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>M.</given-names>
            <surname>Rennhard</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Plattner</surname>
          </string-name>
          , \
          <article-title>Introducing MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection,"</article-title>
          <source>in Proceedings of the Workshop on Privacy in the Electronic Society WPES</source>
          <year>2002</year>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>C. Chen</surname>
            ,
            <given-names>D. E.</given-names>
          </string-name>
          <string-name>
            <surname>Asoni</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Barrera</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Danezis, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Perrig</surname>
          </string-name>
          , \HORNET,
          <article-title>"</article-title>
          <source>in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>M. J. Freedman</surname>
            and
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Morris</surname>
          </string-name>
          , \
          <article-title>Tarzan : A Peer-to-Peer Anonymizing Network Layer,"</article-title>
          <source>Proceedings of the 9th ACM Conference on Computer and Communications Security - CCS '02</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>S.</given-names>
            <surname>Nepal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dahal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Shin</surname>
          </string-name>
          , \
          <article-title>Deanonymizing schemes of hidden services in tor network: A survey,"</article-title>
          <source>in International Conference on Information Networking</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <surname>K. C.-C. Chang</surname>
          </string-name>
          , \
          <article-title>Accessing the deep web,"</article-title>
          <source>Communications of the ACM</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. I.
          <string-name>
            <surname>Sanchez-Rola</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Balzarotti</surname>
            ,
            <given-names>and I. Santos</given-names>
          </string-name>
          , \
          <article-title>The Onions Have Eyes: A Comprehensive Structure and Privacy Analysis of Tor Hidden Services,"</article-title>
          <source>in Proceedings of the 26th International Conference on World Wide Web - WWW '17</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>S.</given-names>
            <surname>Matic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Troncoso</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Caballero</surname>
          </string-name>
          , \
          <article-title>Dissecting Tor Bridges: a Security Evaluation of Their Private and Public Infrastructures," in Network and Distributed System Security Symposium</article-title>
          (NDSS),
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>P.</given-names>
            <surname>Manils</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Abdelberri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Blond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Kaafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelluccia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Legout</surname>
          </string-name>
          , and W. Dabbous, \
          <article-title>Compromising Tor anonymity exploiting P2P information leakage,"</article-title>
          <source>arXiv preprint arXiv:1004.1461</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>M. V.</given-names>
            <surname>Barbera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. P.</given-names>
            <surname>Kemerlis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pappas</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Keromytis</surname>
          </string-name>
          , \
          <article-title>CellFlood: Attacking tor onion routers on the cheap,"</article-title>
          <source>in Lecture Notes in Computer Science (including subseries Lecture Notes in Arti cial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>S.</given-names>
            <surname>Mauw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Verschuren</surname>
          </string-name>
          , and E. de Vink, \
          <article-title>A formalization of anonymity and onion routing,"</article-title>
          <source>Proceedings of ESORICS</source>
          <year>2004</year>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>M. G. Reed</surname>
            ,
            <given-names>P. F.</given-names>
          </string-name>
          <string-name>
            <surname>Syverson</surname>
            , and
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Goldschlag</surname>
          </string-name>
          , \
          <article-title>Anonymous connections and onion routing,"</article-title>
          <source>IEEE Journal on Selected Areas in Communications</source>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>K.</given-names>
            <surname>Bauerd</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sherr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>McCoy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and D.</given-names>
            <surname>Grunwald</surname>
          </string-name>
          , \
          <article-title>ExperimenTor: A Testbed for Safe and Realistic Tor Experimentation," in Cyber Security Experimentation</article-title>
          and Test,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Blond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Manils</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chaabane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Kaafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Legout</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castellucia</surname>
          </string-name>
          , and W. Dabbous, \De-anonymizing
          <source>BitTorrent Users on Tor," World</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. G. Danezis and
          <string-name>
            <given-names>C.</given-names>
            <surname>Troncoso</surname>
          </string-name>
          , \
          <article-title>You cannot hide for long: de-anonymization of realworld dynamic behaviour,"</article-title>
          <source>Proceedings of the 12th ACM Workshop on privacy in the electronic society</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>N.</given-names>
            <surname>Nikiforakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kapravelos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Joosen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kruegel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piessens</surname>
          </string-name>
          , and G. Vigna, \
          <article-title>Cookieless monster: Exploring the ecosystem of web-based device ngerprinting,"</article-title>
          <source>in Proceedings - IEEE Symposium on Security and Privacy</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. T. G. Abbott,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Lieberman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Price</surname>
          </string-name>
          , \
          <article-title>Browser-based attacks on Tor,"</article-title>
          <source>in International Workshop on Privacy Enhancing Technologies</source>
          , pp.
          <volume>184</volume>
          {
          <issue>199</issue>
          , Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>D.</given-names>
            <surname>Arp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yamaguchi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Rieck</surname>
          </string-name>
          , \
          <article-title>Torben: A Practical Side-Channel Attack for Deanonymizing Tor Communication,"</article-title>
          <source>in Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security - ASIA CCS '15</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Xia</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Muppala</surname>
          </string-name>
          , \
          <article-title>A survey of BitTorrent performance,"</article-title>
          <source>IEEE Communications Surveys and Tutorials</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qin</surname>
          </string-name>
          , \
          <article-title>A stealthy attack against tor guard selection,"</article-title>
          <source>International Journal of Security and its Applications</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28. L.
          <string-name>
            <surname>Vanbever</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Rexford</surname>
            , and
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mittal</surname>
          </string-name>
          , \
          <article-title>Anonymity on QuickSand : Using BGP to Compromise Tor,"</article-title>
          <source>in HotNets</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>M. Aiello</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Cambiaso</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Scaglione</surname>
          </string-name>
          , and G. Papaleo, \
          <article-title>A similarity based approach for application DoS attacks detection,"</article-title>
          <source>in Proceedings - International Symposium on Computers and Communications</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Fu</surname>
          </string-name>
          , \
          <article-title>Protocol-level hidden server discovery,"</article-title>
          <source>in Proceedings - IEEE INFOCOM</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31. P. Eckersley, \
          <article-title>How unique is your web browser?,"</article-title>
          <source>in Lecture Notes in Computer Science (including subseries Lecture Notes in Arti cial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32. S. Matic,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kotzias</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Caballero</surname>
          </string-name>
          , \CARONTE:
          <article-title>Detecting Location Leaks for Deanonymizing Tor Hidden Services,"</article-title>
          <source>in Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <given-names>A.</given-names>
            <surname>Sanatinia</surname>
          </string-name>
          and G. Noubir, \
          <article-title>O -path man-in-the-middle attack on tor hidden services," New England Security Day</article-title>
          ,
          <string-name>
            <surname>NESD</surname>
          </string-name>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Fu</surname>
          </string-name>
          , \Tor Bridge Discovery:
          <article-title>Extensive Analysis and Large-scale Empirical Evaluation,"</article-title>
          <source>IEEE Transactions on Parallel and Distributed Systems</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <given-names>K. S.</given-names>
            <surname>Kohls</surname>
          </string-name>
          and
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Popper, \POSTER: Tra c Analysis Attacks in Anonymity Networks,"</article-title>
          <source>in Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security</source>
          , pp.
          <volume>917</volume>
          {
          <issue>919</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <given-names>B. N.</given-names>
            <surname>Levine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Reiter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Wright</surname>
          </string-name>
          , \
          <article-title>Timing attacks in lowlatency mix systems,"</article-title>
          <source>in FC</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <given-names>S.</given-names>
            <surname>Chakravarty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. V.</given-names>
            <surname>Barbera</surname>
          </string-name>
          , G. Portokalidis,
          <string-name>
            <given-names>M.</given-names>
            <surname>Polychronakis</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Keromytis</surname>
          </string-name>
          , \
          <article-title>On the e ectiveness of tra c analysis against anonymity networks using ow records,"</article-title>
          <source>in Lecture Notes in Computer Science (including subseries Lecture Notes in Arti cial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <given-names>T.</given-names>
            <surname>Ishitaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Elmazi</surname>
          </string-name>
          , Y. Liu,
          <string-name>
            <given-names>T.</given-names>
            <surname>Oda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Barolli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Uchida</surname>
          </string-name>
          , \
          <article-title>Application of Neural Networks for Intrusion Detection in Tor Networks,"</article-title>
          <source>in Proceedings - IEEE 29th International Conference on Advanced Information Networking and Applications Workshops</source>
          ,
          <string-name>
            <surname>WAINA</surname>
          </string-name>
          <year>2015</year>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <given-names>A.</given-names>
            <surname>Cuzzocrea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Martinelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mercaldo</surname>
          </string-name>
          , and G. Vercelli, \
          <article-title>Tor tra c analysis and detection via machine learning techniques,"</article-title>
          <source>in Proceedings - 2017 IEEE International Conference on Big Data, Big Data</source>
          <year>2017</year>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>