FINDING · EVALUATION

Fano's inequality establishes a theoretical lower bound on deanonymization error probability as a function of anonymity set size |Θ|, prior uncertainty H(X), and mutual information leakage I(X;Y). For a network of N sufficiently large nodes with uniform routing, Pe ≥ (log N − 1) / log(N−1), approaching 1 (perfect anonymity). The authors found that closed-form estimation of I(X;Y) from I2P traffic features was analytically intractable, requiring ML approximation — and that ML also failed in practice.

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

Implications

Tags

censors
generic
techniques
flow-correlationtraffic-shape
defenses
tor

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