KIT | KIT-Bibliothek | Impressum | Datenschutz

Breaking and (Partially) Fixing Onion Routing with Fragmentation

Schadt, Daniel ORCID iD icon 1,2; Coijanovic, Christoph ORCID iD icon 1,2; Strufe, Thorsten ORCID iD icon 1,2
1 Karlsruher Institut für Technologie (KIT)
2 Kompetenzzentrum für angewandte Sicherheitstechnologie (KASTEL), Karlsruher Institut für Technologie (KIT)

Abstract:

Mix networks are a cornerstone of anonymous communication, protecting users' relationships by relaying their messages through a series of mix nodes. To accommodate large payloads, deployed systems rely on message fragmentation, but this seemingly benign feature unwittingly opens a subtle door for adversaries.

In this paper, we show that fragmentation enables adversaries to tag messages by suppressing single fragments and thereby break sender-recipient unlinkability, striking at the core privacy guarantee of mix networks. We demonstrate the practicality of this attack on Nym, a real-world deployed mix network. To address this threat, we design a lightweight mitigation that incurs only little overhead in both packet size and processing time. We provide a formal model of fragmentation in mix networks and prove that our mitigation restores unlinkability in this model.


Verlagsausgabe §
DOI: 10.5445/IR/1000196222
Veröffentlicht am 17.08.2026
Originalveröffentlichung
DOI: 10.56553/popets-2026-0120
Cover der Publikation
Zugehörige Institution(en) am KIT Kompetenzzentrum für angewandte Sicherheitstechnologie (KASTEL)
Publikationstyp Zeitschriftenaufsatz
Publikationsjahr 2026
Sprache Englisch
Identifikator ISSN: 2299-0984
KITopen-ID: 1000196222
HGF-Programm 46.23.01 (POF IV, LK 01) Methods for Engineering Secure Systems
Erschienen in Proceedings on Privacy Enhancing Technologies
Verlag De Gruyter
Band 2026
Heft 4
Seiten 272–289
Schlagwörter message fragmentation, mix network, onion routing
Nachgewiesen in OpenAlex
KIT – Die Universität in der Helmholtz-Gemeinschaft
KITopen Landing Page