FINDING · DETECTION

Applying Fano's inequality, the paper proves Pe ≥ (H(X)−1)/log|Θ|, showing that deanonymization error rate approaches 1 (perfect anonymity) when the anonymity set |Θ| is large and mutual information leakage I(X;Y) between observed traffic Y and target identity X is minimized. A uniform default tunnel length of 3 hops across all nodes, for example, contributes no differential leakage because p(y=3)=1, illustrating that standardized network parameters reduce identifiability.

From 2026-rohrer-convolutional-neural-networks-deanonymisation-i2pConvolutional-Neural-Networks for Deanonymisation of I2P Traffic · §III-A, Equation (2) · 2026 · arXiv preprint

Implications

Tags

censors
generic
techniques
traffic-shapeml-classifierflow-correlation
defenses
randomization

Extracted by claude-sonnet-4-6 — review before relying.