Anonymity Mixes as (Partial) Assembly Queues: Modeling and Analysis

07/26/2019
by   Mehmet Fatih Aktas, et al.
0

Anonymity platforms route the traffic over a network of special routers that are known as mixes and implement various traffic disruption techniques to hide the communicating users' identities. Batch mixes in particular anonymize communicating peers by allowing message exchange to take place only after a sufficient number of messages (a batch) accumulate, thus introducing delay. We introduce a queueing model for batch mix and study its delay properties. Our analysis shows that delay of a batch mix grows quickly as the batch size gets close to the number of senders connected to the mix. We then propose a randomized batch mixing strategy and show that it achieves much better delay scaling in terms of the batch size. However, randomization is shown to reduce the anonymity preserving capabilities of the mix. We also observe that queueing models are particularly useful to study anonymity metrics that are more practically relevant such as the time-to-deanonymize metric.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2019

Throughput and Delay Analysis of Slotted Aloha with Batch Service

In this paper, we study the throughput and delay performances of the slo...
research
08/13/2017

Large Batch Training of Convolutional Networks

A common way to speed up training of large convolutional networks is to ...
research
01/24/2019

Large-Batch Training for LSTM and Beyond

Large-batch training approaches have enabled researchers to utilize larg...
research
12/23/2022

Delay Analysis of IEEE 802.11be Multi-link Operation under Finite Load

Multi-link Operation (MLO), arguably the most disruptive feature introdu...
research
03/27/2023

Sigmoid Loss for Language Image Pre-Training

We propose a simple pairwise sigmoid loss for image-text pre-training. U...
research
11/03/2021

The Impact of Batch Learning in Stochastic Bandits

We consider a special case of bandit problems, namely batched bandits. M...
research
08/06/2019

Enumerating k-arc-connected orientations

We give simple algorithms to enumerate the α-orientations of a graph G i...

Please sign up or login with your details

Forgot password? Click here to reset