<!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>Virtual &amp; Invisible Private Network: a Zero-Trust Architecture for Anonymous Communication on the Internet</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Frédéric Laurent</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Baptiste Polvé</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guillaume Nibert</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexis Olivereau</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Snowpack</institution>
          ,
          <addr-line>F-91400, Orsay</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sorbonne Université</institution>
          ,
          <addr-line>CNRS, LIP6, F-75005 Paris</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Université Paris-Saclay, CEA, List</institution>
          ,
          <addr-line>F-91120, Palaiseau</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <fpage>101</fpage>
      <lpage>116</lpage>
      <abstract>
        <p>We present the first version of Virtual &amp; Invisible Private Network (VIPN), a novel low-latency, secure, and anonymous communication technology designed to overcome the limitations of existing network anonymization architectures. Traditional decentralized systems require trusting intermediary proxies in charge of relaying users' trafic. This reliance introduces significant vulnerabilities, including potential trafic attribution, man-in-the-middle attacks and sensitive information exposure if a relay is compromised. Additionally, these architectures often lack compatibility with all IP protocols and QoS; thus they fail to support modern applications efectively. In this paper, we review the shortcomings of current approaches and propose a new architecture that mitigates these risks. We evaluate the guarantees of our solution against various adversarial models and provide first insights from a real-world deployment. Finally, we highlight the current architecture limitations and future ongoing challenges.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Anonymous communications</kwd>
        <kwd>Security and privacy</kwd>
        <kwd>Anonymity and untraceability</kwd>
        <kwd>Anonymization</kwd>
        <kwd>Network overlay</kwd>
        <kwd>Routing protocol</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>While it can be used for criminal purposes, anonymity is essential for multiple reasons such as
privacy protection, freedom of speech, investigations (law enforcement and journalism), and
ifght against crime or foreign influence. Indeed, detecting and combating criminal networks and
their operations, organized as an industry often on social networks or hidden forums, require
extensive anonymous data collection capabilities. This involves using scrapers and avatars
for targeted infiltration of social media platforms or forums. However, present anonymization
solutions rely today on trusted third parties (TTP), particularly the relay, requiring a
tradeof between anonymization quality and operational security. Ad hoc anonymization chains
ofer full control but lack mass efect and raise attribution risks. On the contrary, common
anonymization solutions (mass-market VPNs, residential proxies, Tor, I2P, etc.) blend users into
CEUR
Workshop</p>
      <p>Proceedings
published 2025-12-22</p>
      <p>
        a larger users’ pool but present risks [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] that can be unacceptable in the context of national
security and defense. In this article, authors are presenting Virtual &amp; Invisible Private Network
(VIPN), a new anonymization architecture that aims not to rely on TTP. Thus, Section 2 reviews
current benefits and limitations of state-of-the-art anonymization solutions. Then, Section 3
highlights the objectives of the proposed zero-trust architecture, in particular its threat model.
Section 4 describes the proposed designed architecture and its protocol. Section 5 evaluates the
solution against diferent threat actors as well as experience feedback from a real deployment.
Finally, Section 6 presents additional challenges that the architecture still needs to solve.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        David Chaum laid the foundations of anonymous communications field in 1981 in Untraceable
electronic mail, return addresses, and digital pseudonyms [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The approach involves inserting
intermediary nodes, called mixes, between senders and receivers, forming a mix cascade. To
complicate trafic analysis and prevent identifying senders and receivers from network data,
each mix must receive a certain number of messages until a threshold is reached, forming a batch
of messages. Each mix then applies cryptographic operations to messages, lexicographically
reorders them, and flushes them out from the newly ordered batch. This batching process
introduces delays, rendering trafic analysis attacks more dificult, but also degrades quality of
service due to bursty communication. Moreover, it requires large storage space. As a result,
Chaum’s mix cascades are unsuitable for modern low latency and data intensive applications.
      </p>
      <p>
        From this seminal paper, subsequent research on anonymity networks has advanced
significantly, enabling the identification of four classes of anonymity networks [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]:
• mixnets [
        <xref ref-type="bibr" rid="ref1 ref2">2, 1</xref>
        ] based, which apply cryptographic operations and mix messages through
several intermediate servers to mask origin and destination of messages;
• Tor and Onion Routing [
        <xref ref-type="bibr" rid="ref1 ref3 ref4">3, 1, 4</xref>
        ] based, route upstream trafic by successively encrypting
the message (like an onion) through a series of relay nodes to mask origin and destination.
      </p>
      <p>
        For downstream, nodes decrypt onion layers until the destination is reached;
• random walks and DHT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] based, which work by sending messages through a nodes
decentralized network. In these networks, messages are routed either by using random
walk algorithms or through a structured DHT-based mechanism. Nobody has a complete
route view from the sender to the receiver, including themselves;
• DCnets (Dining-Cryptographer) [
        <xref ref-type="bibr" rid="ref1 ref5">1, 5</xref>
        ] based, allow group members to communicate public
messages anonymously with no one knowing who sent or received a specific message.
Unclassified anonymity networks (I2P [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], P5 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], CAR [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], etc.) exist and can fall into several
classes. In addition to those classes, Pfitzmann and Köhntopp introduced a precise
terminology for the field, defining key concepts such as anonymity, unlinkability, unobservability,
pseudonymity, as well as the roles of sender, receiver, etc. in 2001 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        Mixnets. Vuvuzela [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] operates in synchronous rounds and requires only one honest node
to ensure anonymity properties. But, its application is limited to private chat. Stadium [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
an improvement over Vuvuzela, operates on a tree structure rather than the Vuvuzela single
chain. It uses diferential privacy techniques along with cover trafic, ofering stronger privacy
guarantees and significantly enhancing Vuvuzela scalability. AnonPoP [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], similar to Vuvuzela,
is vulnerable to active trafic analysis attacks and is limited to email or messaging use.
      </p>
      <p>
        Atom [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] overcomes secure low-latency communications challenge. Instead of letting users
define message route, it uses a modified ElGamal encryption scheme to let servers collaboratively
process messages without revealing their keys to users. Servers are grouped into ’anytrust’
groups; thus if there is at least one honest server per group, the system is protected from
malicious servers. The architecture is ideal for anonymous microblogging and secure initial
contact, as it efectively balances scalability with robust protection against trafic analysis.
      </p>
      <p>
        Rifle [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] focuses on eficiency while providing strong privacy. It combines verifiable shufling
and onion encryption with a unique approach called symmetric-key private information retrieval
(PIR). To make tracking origin dificult, messages are shufled and encrypted multiple times by a
series of servers. Moreover, it significantly reduces the computational load and latency making
it well-suited for scenarios where both anonymity and performance are crucial.
      </p>
      <p>
        cMix [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] reduces real-time cryptographic latency and computational costs, particularly for
lightweight devices. This achieved with a precomputation phase to eliminate time-consuming
real-time public-key operations need during the actual communication process. This allows
core real-time phase to focus solely on fast modular multiplications, making it highly eficient.
By sending messages batches through a mixnodes cascade with an encoded route, cMix ensures
strong anonymity, unlinkability between senders and receivers, and robust resistance to trafic
analysis attacks. Thus cMix is particularly suitable for low-latency applications such as secure
chat, ofering strong privacy protections even against global adversaries.
      </p>
      <p>
        Loopix [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] is the anonymity network, behind Nym [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], that builds a layered mixnet,
enhancing privacy through Poisson-distributed message timing and cover trafic. Each client
sends both real and cover messages, including "loop" messages, at Poisson determined intervals.
Loop and cover messages obscure communication patterns and improve resistance to trafic
analysis. The layered architecture helps to scale efectively as the network grows. Although
Loopix ofers strong anonymity and lower latency than usual, the latency remains too high for
real-time applications like VoIP or streaming.
      </p>
      <p>
        Tor and Onion Routing. Tor [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is the most well-known and with 3M daily users is
widely adopted. It routes internet trafic through a network of volunteer-operated relays,
which are nodes that pass on encrypted data. The user’s data is encrypted in layers,
like an onion. Each relay encrypts or decrypts a layer before passing to the next one.
While Tor ofers good balance between anonymity and latency, enabling relatively fast
web browsing while masking users’ identities, it is more vulnerable to trafic correlation
attacks compared to Vuvuzela or Stadium and requires trust in the relays, especially the exit one.
Random walks and DHT. Freenet [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] is a peer-to-peer, censorship-resistant file-sharing and
storage system. It operates on a decentralized network where files are redundantly stored
across multiple nodes. Freenet uses adaptive routing based on Distributed Hash Tables (DHT)
to locate files via their binary keys over a depth-first search combined with heuristic methods.
The system ensures plausible deniability by making it unclear whether a node is the request
originator or simply relaying it. The Darknet mode enhances privacy by relying on trusted
      </p>
      <p>connections for routing within the user’s social network.</p>
      <p>
        GNUnet [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] is a censorship-resistant content-sharing system that has expanded to support
various applications, including anonymous file-sharing via the GNUnet Anonymous Protocol
(GAP). GAP provides anonymity for both requesters and responders using a credit-based
routing system, where nodes earn credits by relaying requests and responses. GAP also includes
mechanisms to prevent routing loops and allows nodes to opt out of return paths based on
network conditions and their load, enhancing both network eficiency and privacy.
      </p>
      <p>
        Octopus [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], aims to prevent malicious nodes from biasing the routing process while
ensuring anonymity in communication paths. It uses iterative lookups, where queries are sent
to the closest node in the local routing table until the target is found. Node selection occurs in
two phases: initially by the path initiator and then by the last node chosen. Octopus conceals
real queries by splitting them across multiple paths and adding dummy trafic. It also includes
security measures to detect and exclude malicious nodes.
      </p>
      <p>
        DCnets. Dissent [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], introduced by Corrigan-Gibbs and Ford in 2010, is a latency-tolerant
protocol designed for anonymous communication within small groups. It is built on DC-nets
principles to provide strong sender anonymity through multiparty computation and layered
encryption. Messages are encrypted and shufled among participants to obscure their
origin, ensuring that the sender remains anonymous. While it guarantees the message
content confidentiality through encryption, the protocol’s design allows the possibility of
revealing the message’s presence without disclosing the sender. It also includes
mechanisms to maintain accountability and network integrity by addressing denial-of-service (DoS)
attacks and malicious behavior through techniques such as go/no-go messages and blame phases.
Unclassified . Among unclassified networks, I2P is a popular alternative to Tor. It operates as
a distributed overlay network, composed in 2023 of between 40,000 and 50,000 routers, with
the primary goal of facilitating secure anonymous end-to-end communication between nodes
within I2P. It uses a distributed hash table (DHT) based on Kademlia [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] protocol to manage
network metadata and facilitate node lookups. When users join I2P, they retrieve a list of peers
from external sources and contact floodfill nodes which store and manage routing information
to gather router details. There is eight synchronized floodfill nodes to prevent malicious
manipulation. I2P uses a source-routed approach called garlic routing, where communication
is routed through a series of randomly selected nodes. Unlike Tor’s bidirectional tunnels, I2P
uses distinct unidirectional tunnels to send and receive data. Each user maintains multiple
tunnels, and information about these tunnels is obtained from floodfill nodes. The routing
process involves selecting inbound and outbound tunnels to form the communication path.
      </p>
      <p>P5 is an anonymous communication system that uses a tree-like structure to broadcast
messages. Users are organized into subgroups linked to hierarchical nodes, which allows for
eficient message dissemination. However, the hierarchical mode implies that topper position
gets better performance in exchange of being more identifiable. Thus, P5 highlights the trade-of
between communication eficiency and anonymity level.</p>
      <p>CAR enhances privacy in wireless ad hoc networks, which are vulnerable to passive attacks
and eavesdropping. Along a path, nodes are linked in a virtual chain where each node only
knowing its immediate neighbors. In addition, CAR uses unicast-based broadcasting for route
discovery, and data is exclusively transmitted along the established routes. This approach
conceals node identities and protects against tracking and linking, providing robust privacy
against various passive and some active threats.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Motivation and Goals</title>
      <p>
        Among the solutions presented in Section 2, our focus is put on the systems with an active
community of users while serving popular anonymization purpose such as VPNs (equivalent
to a deterministic single-hop mixnet), Tor network, I2P and Nym. All require making
tradeofs between quality of service and security which imply limitations. Here are few of these
limitations: consumer VPNs are TTPs, so compromising the VPN service operator gives full
content access; moreover VPN connectivity provider can easily perform network analysis
for deanonymization purposes. Tor, assimilated to a VPN cascade, remains exposed to trafic
analysis attacks [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] and the exit node also acts as TTP [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. I2P is vulnerable to Sybil attacks1
where an attacker creates multiple nodes to compromise the network. The recent Nym network
is limited to very few services even if work is underway to be usable for other applications
(e.g.: use the infra as a peer-to-peer VPN), and the way the onion is constructed is based on
the Sphinx packet format [
        <xref ref-type="bibr" rid="ref16 ref25">16, 25</xref>
        ], which is known to be vulnerable [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Unfortunately, Nym’s
Sphinx modified version is recent and has no specification 2. In addition, most solutions do not
use perfectly secure encryption, most cannot withstand a polynomially unbounded adversary
(i.e.: attackers able to break computationally bounded protocols). Finally, as the architectures
authorize access outside the overlay, exit nodes are TTP, relay sees both user’s upstream and
downstream trafic and can therefore perform man-in-the-middle (MITM) attacks.
      </p>
      <p>With these limitations in mind, our goal is to design a technology that presents novel
anonymity properties without impairing as much on users quality of experience. In this paper
we address the specific issue of TTP in core anonymization networks’ architecture building block
as it is an aspect that has so far been insuficiently covered by present solutions. We therefore
designed a novel architecture that does not rely on any trusted third party at this level. Our
design is based on a self reinforcement of security and anonymity properties to eliminate TTP
at message routing level, thereby enhancing resilience against powerful adversaries. Because
it ofers properties beyond sole anonymity and presents a spectrum of applications similar to
VPN, we call this technology Virtual and Invisible Private Network (VIPN). This system will
have to be improved to address trust in the management component of the system.</p>
      <sec id="sec-3-1">
        <title>3.1. Threat Actors</title>
        <p>We consider the following threat actors, ordered from least to most powerful, who may attempt
to deanonymize users, intercept or modify content, or alter VIPN behavior: i. Individual
hacker: it may try diferent scripts to alter the normal VIPN behavior; ii. ISP: user’s ISP may
identify trafic going through VIPN; iii. Core network operator: it can have access to several
1Invisible Internet Project (I2P), I2P’s Threat Model, 2010. Available at
https://geti2p.net/id/docs/how/threatmodel#sybil, accessed on 22 May 2024.
2D. Hrycyszyn, Document the packet format, 2020. Available at: https://github.com/nymtech/sphinx/issues/35,
accessed on 27 August 2024.</p>
        <p>ISPs trafic; iv. Cloud provider: it can have access to several servers; v. Data center operator:
it can have access to servers from several operators; vi. State: it can request access to several
data center, as well as ISPs; vii. Global cooperation: it potentially has access to data from
several colluded states.</p>
        <p>
          We propose to study rigorously the network anonymity and security properties as detailed in
subsection 3.2, we pool threat actors into adversaries classes commonly used in the literature. As
for any anonymity network, we study the polynomially bounded global passive adversary (GPA).
This adversary is able to observe the entire network, the trafic between nodes and users. They
know the network topology and can carry out trafic analysis or passive network attacks such
as BGP-rerouting [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. They cannot modify, inject, delete or add IP network packets in trafic,
nor break computationally bounded security protocols. We also study a local adversary which
can only see a few network resources, may modify, inject, delete or add network packets, can
compromise certain network nodes and their secrets and attempt to diverge from the protocol.
This adversary is studied under two characteristics: polynomially bounded, by not being able
to break computationally bounded cryptographic protocols (e.g. any public-key encryption
schemes, AES, TLS, Onion encryption, etc.), and polynomially unbounded, by being able to
break computationally bounded cryptographic protocols but not information-theoric secure
protocols (e.g. One-time Pad, Shamir’s secret sharing, etc.). Finally, we end with two other very
much stronger adversary capabilities: the global active polynomially bounded adversary and its
unbounded version. In both cases, the adversary does not control any node, but controls all the
network overlay links.
        </p>
        <p>The primary adversary goal is to break honest anonymous users anonymity and security,
i.e. to determine users’ identities, their contacts, and the messages they exchange. The second
adversary goal is to perform a MITM attack inside the network overlay, no matter if anonymity
is broken or not. Then, its third goal is to degrade network quality of service, by performing
DoS, crashing nodes, trying to make the protocol deviate so that it stops working, etc.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Anonymity and Security Goals</title>
        <p>As mentioned above, we describe and consider properties related to the core VIPN principles (i.e.
network overlay architecture and protocol). We are not addressing other system component
aspects such as interactions with the nodes’ directory and access control to this directory. In
particular the two latter being TTP, they raise specific challenges that will be addressed in future
papers. As a result, we focus only on the network overlay architecture including the route
creation, between a VIPN user and one Online Service they want to access anonymously. Finally,
similar to Tor’s onion services, VIPN can support a "tunnel" mode for direct communication
between two users. This mode builds upon the “privacy mode” described in this paper and will
be detailed in future works.</p>
        <p>
          VIPN intends to guarantee the following anonymity properties, based on those defined in the
Pfitzmann and Köhntopp paper [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], formally defined in Backes et al. paper [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ]:
• Sender anonymity: a particular message cannot be linked to any sender, and no message
can be linked to a specific sender. This concept implies that an adversary cannot determine
which of two possible senders is communicating with a target receiver.
• Sender unobservability ensures that an adversary cannot tell whether a sender is
communicating or not. It directly implies sender anonymity notion. If an adversary cannot observe
whether a particular user has sent a useful message or a dummy message (noise, loop
message, etc.), this ensures that the adversary cannot identify which user is communicating
with the target receiver.
• Sender-Receiver unlinkability ensures that unauthorized third-parties cannot link senders
and receivers, meaning that an adversary cannot determine whether two specific users are
communicating with each other, this property is key for guaranteeing against attribution.
VIPN also aims to guarantee user’s message secrecy inside the overlay. In addition, we introduce
a new property called transparent man-in-the-middle resistance, guaranteeing a MITM attack
detect-ability between the anonymity network user and the online service contacted. Thus, the
packet alteration inside the network should not be meaningful for the service.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Service Goals</title>
        <p>VIPN also should ofer several service goals:
• Low latency and high-capacity: the network overlay should be suitable for low-latency
and data intensive applications such as VoIP, instant messaging, file transfer, etc.
• Scalability: as other anonymity networks, it should scale to serve large number of users
by eficiently deploying new proxies if necessary.
• Compatibility: as other anonymity networks, it should be IP compatible but contrary to
most anonymity networks, it should be compatible with all transport protocols.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Virtual &amp; Invisible Private Network Design and Protocol</title>
      <sec id="sec-4-1">
        <title>4.1. Overview</title>
        <sec id="sec-4-1-1">
          <title>4.1.1. Principles</title>
          <p>VIPN is made to be deployed over an IP network, to anonymize IP trafic using common transport
protocols (TCP, UDP, ICMP) and its architecture relies on several complementary principles: i.
A distributed network overlay composed of several proxies (also called nodes) operated by
various entities (active users or partners similar to miners). Nodes relay protocol messages in a
specific way, depending on their role in the transmission; ii. Multiple and user-defined
complementary paths: Nodes are used at least on two complementary paths defined by the users’
device through its application (connector). iii. Packet anonymization and fragmentation:
because VIPN relies on circuit routing, source public IP addresses are unnecessary and are
therefore discarded to protect users anonymity. Anonymized IP packets are therefore fragmented
into complementary "snowflakes" through a secret-sharing mechanism (currently the XOR logic
operator with a randomly generated one-time pad); iv. Paths anonymous auto-discovery:
paths are anonymously connected inside the network thanks to specific autodiscovery messages
based on the aforementioned snowflake-based secret-sharing mechanism; v. A distributed
exit node to asymmetrize the trafic, external communication is done through collaborative
spoofing between two nodes chosen by the user, which helps prevent MITM attacks.</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.1.2. Components</title>
          <p>VIPN is made up of various elements necessary for its operation:
• Nodes (proxies): servers forwarding the trafic. Those nodes can be categorized in
diferent categories for a specific user route:
– Holonode: node seen by the contacted online service.
– S-Node: standard relay in the network. From the S-Node pool, a user selects a subset
of nodes to perform specific functions for their session:
∗ Pu nodes: nodes close to the user, they act as entry point and therefore know
the user’s IP address;
∗ Ps master node: node responsible for managing upstream trafic and relaying
snowflakes for downstream trafic as well as to discover its slave;
∗ Ps slave node: relay to Ps master node snowflakes for upstream trafic and
receives snowflakes from holonode for downstream trafic.
• Nodes’ directory (currently an accepted trusted third party): directory containing the
diferent nodes information and status. It is available only to users in users’ directories.
• VIPN agent: software installed on a user’s device to anonymize it through the overlay.
• VIPN Users directory (currently an accepted trusted third party): central databases
containing user’s information and authorization for access control management. These
directories users have access to nodes’ directory. VIPN includes this access control to
comply with regulatory laws, but it is not required for achieving the system’s properties.
To anonymize a device, VIPN agent needs to establish a route. This route consists of at least
5 nodes: 4 S-Nodes (including 2 Pu nodes, 1 Ps master, and 1 Ps slave) and 1 Holonode. Each
route has two separate paths, each made up of several serialized circuits between the nodes.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Route construction</title>
        <p>There are several steps involved in creating this route, all based on the user choices (cf. figure 1):
• Step 1: User selects at least 5 distinct nodes: 1 Holonode (H) and at least 4 S-nodes.
• Step 2: User builds two circuits, one between himself and S-node 1 (S1) and one between
himself and S-node 2 (S2).
• Step 3: To complete the two disjoint paths (i.e.: paths where nodes cannot be part of the
two paths), the user requests through his channels established on step 2 that two other
circuits get created, one between S1 and S3, one between S2 and S4.
• Step 4: S3 (master node, role defined by the user) searches for its slave (S 4), this is the
auto-discovery step. Indeed, to prevent an observer on user-S3 path to be in a position to
discover the second path, the user will not communicate itself S4 IP address to S3. It uses
a key anonymity preserving autodiscovery scheme. This scheme includes following steps:
i. User generates a token ( ) and builds an autodiscovery secret ( ) as follow:
 =  | ℎℎ( | 3 | 4 ) |  ; ii. User generate a one-time pad (_)
and computes _ as follow: _ = _ ⊕  ; iii. User passes _ and
_ respectively up to S3 and S4 through their respective paths; iv. S3 broadcasts _
to the whole network overlay. v. Because S4 holds _ it can recover the 
and knowing S3 is the sender confirms with guarantees that it needs to collaborate. In
addition it discovers H. vi. S4 can now send _ to S3. S3 can then perform the similar
operation and verify S4 legitimacy as well as discovering H. The bruteforce is prevented
thanks to  and the exchange through TLS of the diferent autodiscovery messages.
• Step 5: S3, S4 and H can create circuits between each other to complete the route.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Nominal mode</title>
        <p>After the user creates their VIPN route (as explained earlier), they can use it to connect to online
services. Here, we explain how they communicate with a service (cf. figure 2).
• Steps 1 &amp; 2. OTP encryption is used. User removes the source IP address from the metadata
of the plain request, then produces a ciphertext by randomly generating a mask (same size
of the request) which they XOR with their plaintext request (⊕   =
ℎ). The mask is sent on one path of the route (S1-S3), the ciphertext on the other
(S2-S4-S3). Mask and ciphertext are called snowflakes .
• Step 3 &amp; 4. Once both snowflakes are received by S 3, they are recombined ( ⊕
ℎ =  ). S3 then fakes H’s IP address as the source in the
IP packet header when sending the request to the service, alerts H that it will receive
IP packets from Service, and then sends the IP packet over Internet. When it receives
the request, Service does not know about S3 and sends its response to H. With this
collaborative spoofing, VIPN distributes the exit node, so upstream and downstream
trafic do not pass through a single node, preventing MITM attacks in the network
overlay.
• Steps 5 &amp; 6. Because H has been warned by S3, it intercepts IP packets from Service and
knows the associated session so it can put them in the proper circuits. Therefore, when the
service replies, H intercepts the response and removes its IP address from the destination
ifeld in the IP packet, fragments the same way as User into two new complementary
snowflakes, and sends them on the two paths. Once User has received them, User XORs
them back, adds its own IP address in the destination field and reinjects the trafic in its
local network stack. This process allows multiple users to contact the same service, as the
session identification relies on the source port used by the user. In case of a port collision,
collaborative PAT (synchronized between S3 and H) handles the transformation.
Finally to enhance security and make it harder to track trafic, all circuits between nodes are
bidirectional and multiplexed through the same TLS-protected socket. However, we consider
that the system must keep its properties if TLS gets broken.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Observed properties</title>
        <p>With this architecture, no node has access to both the full content, User identity, and Service
identity at the same time.</p>
        <p>Specifically: i. S 1 and S2 knows User, but not Service; ii. S3 knows Service but not User; iii. S4
knows neither User nor Service; iv. H knows only Service. Additionally, no node can know the
entire route, regardless of its computing power. User remains the only one who controls and
knows the full route. As for the trafic content, no single node can access all of it since it is
mostly protected by fragmentation or asymmetrization:: i. S1 and S2 only see snowflakes; ii. S 3
only sees upload trafic; iii. S 4 route only snowflakes; iv. H only has access to download trafic.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation</title>
      <sec id="sec-5-1">
        <title>5.1. Resistance against threat actors</title>
        <sec id="sec-5-1-1">
          <title>5.1.1. Passive adversaries</title>
          <p>Polynomially bounded global passive adversary (GPA). In the bounded GPA case, VIPN provides
sender anonymity. The attacker might know a user is connected to a node since it knows all the
nodes, but it cannot track how the user is anonymized because it cannot follow the trafic. Indeed,
it cannot break the TLS encryption between nodes or access the routing table to trace the trafic.
To reduce sender-recipient unlinkability, the attacker could theoretically monitor inbound and
outbound trafic. However, the trafic is asymmetrized, so the attacker cannot distinguish users.
Regarding secrecy, the TLS encryption is unbreakable by this attacker, so the messages remain
safe within the overlay. As for resistance to transparent MITM attacks, the user is passive and
cannot modify the packets. Finally, the protocol does not ofer sender unobservability by default.
However, if the user chooses to send dummy packets, the attacker cannot tell them apart from
real packets, as the connection between users and nodes is TLS-protected.</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>5.1.2. Active adversaries</title>
          <p>Local polynomially bounded and unbounded attacker. As a reminder, VIPN ofers unique features
compared to other anonymization networks. Besides ensuring that no node knows both the
User and the Service of a specific session at the same time, it also prevents a local attacker from
knowing if a specific user is contacting a specific service. This guarantees sender-recipient
unlinkability. VIPN secures both the content and the operation: i. regardless of computing
power, nodes S1, S2, S4, and any observer on these circuits cannot access the content; ii. even
if S3 and H see User trafic, they can only access upstream or downstream flows, preventing
a MITM attack. Thus, against a local corrupt node, VIPN is transparent MITM resistant for
each node’s role. Secrecy is maintained in all cases, as no node has access to both upstream
and downstream flows. Even with unbounded nodes, snowflakes preserve secrecy due to the
one-time pad encryption. Regarding sender unobservability, it is ensured in all cases because
nodes only see snowflakes when they know the user, and due to the OTP encryption, they
cannot decrypt the packets. Finally, sender anonymity is preserved in all cases, as no node can
know how the user is anonymized. Pus know the users but not H, while Pss and H know the H
but not the associated users.</p>
          <p>Polynomially bounded global active adversary (GAA). If the attacker has deployed probes
on all network elements but cannot decrypt TLS, they will not be able to recombine the
snowflakes, keeping the secrecy intact. Additionally, the attacker cannot actively modify
the trafic, even if they intercept and hold back all the data, maintaining VIPN’s transparent
MITM resistance. However, the attacker can still analyze trafic by adding delays to the
snowflakes, which could break both sender anonymity and sender-receiver unlinkability.
Adding delays is more complex than in traditional anonymity networks because the complexity
increases with the trafic of other snowflakes. Active attacks on one path will not afect
the exit trafic on another path, as the paths have diferent lengths. Also, the attacker</p>
          <p>cannot watermark the snowflakes since they cannot access the content to generate a fake
snowflake (snowflakes are protected by TLS 1.3). As a result, we consider our proposal partially
resistant to this type of attack on sender anonymity and sender-receiver unlinkability. Finally,
regarding sender unobservability, we are in the GPA case where the protocol does not ofer
it by default. However, if the user decides to send dummy packets, the adversary cannot
tell them apart from real ones, since the connection between users and nodes is protected by TLS.
Polynomially unbounded global active adversary. If the attacker has deployed probes on all
network elements and can decrypt TLS, they can access the snowflakes and, being unbounded,
gain access to the full message. From this message, they can also determine the number of
circuits, allowing them to break all anonymity properties, including sender anonymity,
senderrecipient unlinkability, and sender unobservability. Regarding secrecy, the attacker can access
and decrypt the message if it is encrypted. To manipulate the trafic and break transparent
MITM resistance, the attacker could theoretically synchronize their clock to make the modified
trafic intelligible.
5.1.3. Summary
In Table 1, we summarized the guarantees ofered by VIPN against the studied threat actors.
VIPN proves to be robust and efectively maintains the desired properties against both passive
and local adversaries. However, it is not fully resistant to global active adversaries, although
the bounded one is blocked in many cases due to the architecture. This remains acceptable as
these adversaries would need to: i. deploy probes across the overlay, requiring collaboration or
infiltration in foreign countries; ii. store all overlay trafic, which requires significant storage
capacity; iii. decrypt the trafic, even in real time, if the attack is time-sensitive; iv. recombine
the right snowflakes, which requires substantial computing power (the recombination is a
combinatorial problem that follows a power law based on the number of snowflakes in the
overlay), and there is no guarantee that the elements will be coherent due to OTP encryption.
Finally, the theoretical approach does not account for the time needed to break these guarantees.</p>
          <p>X means that the property is verified.</p>
          <p>X* means that the property is not ofered by default but is verified if the user sends useless packets.</p>
          <p>~ means that the property is partially verified: it is verified on the basis of an uncalculated minimum quantity of network trafic processed by the adversary.</p>
          <p>Since global active adversaries are not fully realistic at present, especially with polynomially
unbounded corruption power, this initial evaluation will be followed by a future paper. The
upcoming paper will explore an additional adversary capable of corrupting only a partial number
of nodes. This will help demonstrate that if the user trusts a certain percentage of nodes in their
route, the guarantees remain intact, rather than succumbing to the efects of a GAA. The future
work will also investigate the time needed for a bounded GAA to execute an attack.</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Early experiences: VIPN in the Wild</title>
        <p>VIPN is live on public Internet since early 2022. This public deployment includes global validation
of the possibility to deploy collaborative spoofing over several cloud operators (i.e.: spoof and
receive answers); this was quite challenging because by default operators blocks the spoofing in
order to prevent malicious usage of their IPs. For VIPN the spoofed IPs are part of the overlay.</p>
        <p>As of late August 2025, VIPN is deployed over 45 nodes in Europe across 11 countries and
more are added each month depending on users’ demand and code maturity (for comparison
Tor, created 20 years ago, has currently around 8000 relays and bridges but started with 32
relays). Each node is currently connected with at least 300Mbps/300Mbps links, and one half of
the nodes on 10 Gbps/10 Gbps. The number of users or sessions on nodes varies and is dificult
to monitor as we do not want to create hints for any observer but VIPN currently has over 1500
subscribers, i.e. professional or individual user with an active account.</p>
        <p>Users reported to use VIPN for various purposes such as web browsing, obtaining dynamic
ifxed IP list, access to TOR, connecting to their WebRTC applications, access censured content
from foreign countries, etc. The average speed reported with fiber is around 100 Mbps, with
peaks at 250 Mbps. For example to reach a Netherlands IP over Ethernet (via France and the
UK), latency is about 40 ms. In lab tests, launching VIPN locally without any physical routing
latency, resulted in a 2 ms increase compared to the direct route. In comparison, a dedicated
OpenVPN session showed an added 31 ms of latency. This latency contributes to the bandwidth
limitations, which are also afected by the current code version, node capacities, and the use of
TCP over TLS 1.3, which is limited to 10-20 Gbps on standard computers. Since November 2023
and a 1000% increase in users, we have faced no abuse issues and users have reported only few
captchas and blocked websites, alongside those with predefined geographic limitations.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Other limitations</title>
        <p>Several additional risks have been identified that could weaken the system’s anonymity.
• Trafic analysis : the system theoretically remains vulnerable to trafic analysis, even in the
presence of collaborative spoofing, particularly if adversaries control a significant portion
of the nodes or communication flows. To mitigate this threat, we consider integrating:
mechanisms inspired by Loopix, such as cover trafic; integrate variable padding in
snowflakes; leveraging the possibility to split parallely trafic across multiples routes; as
well as developing agent with node capabilities to hide if trafic is related to this user or
only relaying others’ trafic.
• Denial-of-service: the risk of denial-of-service attacks, especially through the exposure of</p>
        <p>IP addresses associated with active nodes is existing due to the centralize nodes database.</p>
        <p>To address this, we intend to leverage architectures based on random walks and distributed
hash tables (DHTs), explore entry proxy-based solutions such as Tor Snowflake and bridge,
and introduce nodes with restricted dissemination capabilities.
• Fingerprints: even if the trafic is caught before going to the overlay (intermediary nodes
are seeing snowflakes), some networking indicators such as the TTL or TCP options may
ifngerprint the trafic to an observer as they are afected by the spoofing mechanism.
Even if this is probably limited, a dedicated study on this subject will help to give insights
on how the trafic must be modified (either at user or at Ps_master to be coherent before
going through the overlay or before leaving it (e.g.: based on information related to the
distance between Ps_master and H to the Service).</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Future Work</title>
      <p>Firstly, VIPN proves robustness against passive and local threats but only partially resists
GAA, whose attacks are limited by practical constraints. Future work will focus on adversaries
corrupting only some nodes, showing that guarantees hold if enough nodes remain trusted, and
will evaluate attack feasibility over time. While VIPN improves resistance to trafic alteration, it
still relies on TTP at systemic level, which is a study accepted limitation: i. as the directories
managing node or user access remain centralized, they could be manipulated to mislead users
or launch attacks. A solution is to implement an anonymity-preserving access control system
but also the decentralization; ii. if node operators are not running the oficial VIPN protocol and
code, vulnerabilities could be introduced to undermine invisibility. Additionally, providing users
with a clear overview of the overlay status to help them make informed decisions when defining
their route without compromising their anonymity or the anonymity of other users is a complex
challenge. This requires developing metrics based on parameters like network heterogeneity and
route duration, which must be disclosed while maintaining privacy. Furthermore, the current
work does not ofer a formal analysis of the protocol; the properties are only proven through
analysis of the architecture models. Therefore, if the implementation or protocol messages are
lfawed, attacks remain possible. Finally, building an anonymity network involves more than
only protocol and architecture. Today, there are various ways to detect and block trafic from
proxies, based on factors like communication reactiveness, IP reputation, IP provider, etc. As a
result, large-scale deployment of VIPN needs also to address these IP marking challenges.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work was supported by the France 2030 cybersecurity acceleration strategy.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used Le Chat and ChatGPT-4 in order to:
Grammar and spelling check, Text Translation, Improve writing style, Paraphrase and reword.
After using these tools, the authors reviewed and edited the content as needed and take full
responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Shirazi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Simeonovski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Asghar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Backes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          <article-title>Survey on Routing in Anonymous Communication Protocols</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>51</volume>
          (
          <year>2018</year>
          )
          <volume>51</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>51</lpage>
          :
          <fpage>39</fpage>
          . doi:
          <volume>10</volume>
          .1145/3182658.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Chaum</surname>
          </string-name>
          ,
          <article-title>Untraceable electronic mail, return addresses, and digital pseudonyms</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>24</volume>
          (
          <year>1981</year>
          )
          <fpage>84</fpage>
          -
          <lpage>90</lpage>
          . doi:
          <volume>10</volume>
          .1145/358549.358563.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Dingledine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mathewson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Syverson</surname>
          </string-name>
          , Tor: The
          <string-name>
            <surname>Second-Generation Onion</surname>
          </string-name>
          Router:,
          <source>Technical Report, Defense Technical Information Center</source>
          , Fort Belvoir,
          <string-name>
            <surname>VA</surname>
          </string-name>
          ,
          <year>2004</year>
          . doi:
          <volume>10</volume>
          .21236/ADA465464.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Goldschlag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Syverson</surname>
          </string-name>
          , Onion routing,
          <source>Communications of the ACM</source>
          <volume>42</volume>
          (
          <year>1999</year>
          )
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          . doi:
          <volume>10</volume>
          .1145/293411.293443.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chaum</surname>
          </string-name>
          ,
          <article-title>The dining cryptographers problem: Unconditional sender and recipient untraceability</article-title>
          ,
          <source>Journal of Cryptology</source>
          <volume>1</volume>
          (
          <year>1988</year>
          )
          <fpage>65</fpage>
          -
          <lpage>75</lpage>
          . doi:
          <volume>10</volume>
          .1007/BF00206326.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>Zantout</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Haraty</surname>
          </string-name>
          ,
          <article-title>I2P data communication system</article-title>
          ,
          <source>in: Proceedings of ICN, Citeseer</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>401</fpage>
          -
          <lpage>409</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sherwood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bhattacharjee</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Srinivasan,</surname>
          </string-name>
          <article-title>P5: A protocol for scalable anonymous communication</article-title>
          ,
          <source>Journal of Computer Security</source>
          <volume>13</volume>
          (
          <year>2005</year>
          )
          <fpage>839</fpage>
          -
          <lpage>876</lpage>
          . doi:
          <volume>10</volume>
          .3233/JCS2005-13602.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shokri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Yazdani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khonsari</surname>
          </string-name>
          ,
          <article-title>Chain-Based Anonymous Routing for Wireless Ad Hoc Networks</article-title>
          ,
          <source>in: 2007 4th IEEE Consumer Communications and Networking Conference</source>
          , IEEE,
          <string-name>
            <surname>Las</surname>
            <given-names>Vegas</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NV</surname>
          </string-name>
          , USA,
          <year>2007</year>
          , pp.
          <fpage>297</fpage>
          -
          <lpage>302</lpage>
          . doi:
          <volume>10</volume>
          .1109/CCNC.
          <year>2007</year>
          .
          <volume>65</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pfitzmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Köhntopp</surname>
          </string-name>
          , Anonymity, Unobservability, and
          <article-title>Pseudonymity - A Proposal for Terminology</article-title>
          , in: H.
          <string-name>
            <surname>Federrath</surname>
          </string-name>
          (Ed.), Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability Berkeley, CA, USA, July
          <volume>25</volume>
          -
          <issue>26</issue>
          ,
          <source>2000 Proceedings, Lecture Notes in Computer Science</source>
          , Springer, Berlin, Heidelberg,
          <year>2001</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . doi:
          <volume>10</volume>
          .1007/3-540-44702-
          <issue>4</issue>
          _
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. van den</given-names>
            <surname>Hoof</surname>
          </string-name>
          , D. Lazar,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeldovich</surname>
          </string-name>
          , Vuvuzela:
          <article-title>Scalable private messaging resistant to trafic analysis</article-title>
          ,
          <source>in: Proceedings of the 25th Symposium on Operating Systems Principles, SOSP '15</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2015</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>152</lpage>
          . doi:
          <volume>10</volume>
          .1145/2815400.2815417.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tyagi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gilad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeldovich</surname>
          </string-name>
          ,
          <article-title>Stadium: A Distributed MetadataPrivate Messaging System</article-title>
          ,
          <source>in: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP '17</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2017</year>
          , pp.
          <fpage>423</fpage>
          -
          <lpage>440</lpage>
          . doi:
          <volume>10</volume>
          .1145/3132747.3132783.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gelernter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herzberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Leibowitz</surname>
          </string-name>
          ,
          <article-title>Two Cents for Strong Anonymity: The Anonymous Post-ofice Protocol</article-title>
          , in: S. Capkun,
          <string-name>
            <given-names>S. S. M.</given-names>
            <surname>Chow</surname>
          </string-name>
          (Eds.),
          <source>Cryptology and Network Security, Lecture Notes in Computer Science</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>390</fpage>
          -
          <lpage>412</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -02641-7_
          <fpage>18</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kwon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Corrigan-Gibbs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Devadas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ford</surname>
          </string-name>
          , Atom: Horizontally Scaling Strong Anonymity,
          <year>2017</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.1612.07841. arXiv:
          <volume>1612</volume>
          .
          <fpage>07841</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kwon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Devadas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ford</surname>
          </string-name>
          ,
          <string-name>
            <surname>Rifle:</surname>
          </string-name>
          <article-title>An eficient communication system with strong anonymity</article-title>
          ,
          <source>Proc. Priv. Enhancing Technol</source>
          . (
          <year>2016</year>
          )
          <fpage>115</fpage>
          -
          <lpage>134</lpage>
          . doi:
          <volume>10</volume>
          .1515/POPETS2016-0008.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chaum</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. Das</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Javani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kate</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Krasnova</surname>
          </string-name>
          , J. de Ruiter, A. T. Sherman,
          <article-title>cmix: Mixing with minimal real-time asymmetric cryptographic operations</article-title>
          , in: D.
          <string-name>
            <surname>Gollmann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Miyaji</surname>
          </string-name>
          , H. Kikuchi (Eds.),
          <source>Applied Cryptography and Network Security - 15th International Conference, ACNS</source>
          <year>2017</year>
          , Kanazawa, Japan,
          <source>July 10-12</source>
          ,
          <year>2017</year>
          , Proceedings, volume
          <volume>10355</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2017</year>
          , pp.
          <fpage>557</fpage>
          -
          <lpage>578</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -61204-1∖_
          <fpage>28</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>A. M. Piotrowska</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Elahi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Meiser</surname>
            ,
            <given-names>G. Danezis,</given-names>
          </string-name>
          <article-title>The loopix anonymity system</article-title>
          ,
          <source>in: 26th USENIX Security Symposium (USENIX Security 17)</source>
          , USENIX Association, Vancouver, BC,
          <year>2017</year>
          , pp.
          <fpage>1199</fpage>
          -
          <lpage>1216</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Halpin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kiayias</surname>
          </string-name>
          , The Nym Network, White Paper, Nym Technologies,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>I.</given-names>
            <surname>Clarke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Sandberg</surname>
          </string-name>
          , B. Wiley,
          <article-title>Protecting free expression online with Freenet</article-title>
          ,
          <source>IEEE Internet Computing</source>
          <volume>6</volume>
          (
          <year>2002</year>
          )
          <fpage>40</fpage>
          -
          <lpage>49</lpage>
          . doi:
          <volume>10</volume>
          .1109/4236.978368.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Grothof, GAP-practical anonymous networking</article-title>
          , in: International Workshop on Privacy Enhancing Technologies, Springer,
          <year>2003</year>
          , pp.
          <fpage>141</fpage>
          -
          <lpage>160</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Borisov</surname>
          </string-name>
          ,
          <article-title>Octopus: A Secure and Anonymous DHT Lookup</article-title>
          ,
          <source>in: 2012 IEEE 32nd International Conference on Distributed Computing Systems</source>
          , IEEE, Macau, China,
          <year>2012</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>334</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICDCS.
          <year>2012</year>
          .
          <volume>78</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>H.</given-names>
            <surname>Corrigan-Gibbs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ford</surname>
          </string-name>
          , Dissent: Accountable anonymous group messaging,
          <source>in: Proceedings of the 17th ACM Conference on Computer and Communications Security - CCS '10</source>
          , ACM Press, Chicago, Illinois, USA,
          <year>2010</year>
          , p.
          <fpage>340</fpage>
          . doi:
          <volume>10</volume>
          .1145/1866307.1866346.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>P.</given-names>
            <surname>Maymounkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mazières</surname>
          </string-name>
          ,
          <article-title>Kademlia: A Peer-to-Peer Information System Based on the XOR Metric</article-title>
          , in: P.
          <string-name>
            <surname>Druschel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Kaashoek</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Rowstron (Eds.),
          <string-name>
            <surname>Peer-</surname>
          </string-name>
          to-
          <source>Peer Systems, Lecture Notes in Computer Science</source>
          , Springer, Berlin, Heidelberg,
          <year>2002</year>
          , pp.
          <fpage>53</fpage>
          -
          <lpage>65</lpage>
          . doi:
          <volume>10</volume>
          .1007/3- 540-45748-
          <issue>8</issue>
          _
          <fpage>5</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L.</given-names>
            <surname>Basyoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Fetais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Erbad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Guizani</surname>
          </string-name>
          ,
          <source>Trafic Analysis Attacks on Tor: A Survey</source>
          , in: 2020 IEEE International Conference on Informatics,
          <source>IoT, and Enabling Technologies (ICIoT)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>188</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICIoT48696.
          <year>2020</year>
          .
          <volume>9089497</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>P.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Köwer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mulazzani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Huber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schrittwieser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lindskog</surname>
          </string-name>
          , E. Weippl, Spoiled Onions:
          <article-title>Exposing Malicious Tor Exit Relays</article-title>
          , in: E. De Cristofaro,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Murdoch</surname>
          </string-name>
          (Eds.),
          <source>Privacy Enhancing Technologies</source>
          , Springer International Publishing, Cham,
          <year>2014</year>
          , pp.
          <fpage>304</fpage>
          -
          <lpage>331</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -08506-7_
          <fpage>16</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Danezis</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Goldberg</surname>
          </string-name>
          ,
          <article-title>Sphinx: A Compact and Provably Secure Mix Format</article-title>
          ,
          <source>in: 2009 30th IEEE Symposium on Security and Privacy</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>269</fpage>
          -
          <lpage>282</lpage>
          . doi:
          <volume>10</volume>
          .1109/SP.
          <year>2009</year>
          .
          <volume>15</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Beck</surname>
          </string-name>
          , T. Strufe,
          <article-title>Breaking and (Partially) Fixing Provably Secure Onion Routing</article-title>
          ,
          <source>in: 2020 IEEE Symposium on Security and Privacy (SP)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>168</fpage>
          -
          <lpage>185</lpage>
          . doi:
          <volume>10</volume>
          .1109/SP40000.
          <year>2020</year>
          .
          <volume>00039</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ballani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Francis</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Zhang,</surname>
          </string-name>
          <article-title>A study of prefix hijacking and interception in the internet</article-title>
          ,
          <source>ACM SIGCOMM Computer Communication Review</source>
          <volume>37</volume>
          (
          <year>2007</year>
          )
          <fpage>265</fpage>
          -
          <lpage>276</lpage>
          . doi:
          <volume>10</volume>
          .1145/ 1282427.1282411.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M.</given-names>
            <surname>Backes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kate</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Manoharan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Meiser</surname>
          </string-name>
          , E. Mohammadi,
          <article-title>AnoA: A Framework for Analyzing Anonymous Communication Protocols</article-title>
          ,
          <source>in: 2013 IEEE 26th Computer Security Foundations Symposium</source>
          , IEEE, New Orleans, LA,
          <year>2013</year>
          , pp.
          <fpage>163</fpage>
          -
          <lpage>178</lpage>
          . doi:
          <volume>10</volume>
          .1109/ CSF.
          <year>2013</year>
          .
          <volume>18</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>