FINDING · DETECTION
A machine-checked EasyCrypt proof demonstrates that a conjunctive SNI + traffic-profile adversary achieves a true positive rate of 1.0 against meek, with a false positive rate bounded by Pr[Game0(MeekEnc).main()=true] ≤ (1/10000) × (1/1000) ≈ 10⁻⁷, under the assumption that meek traffic follows a normal distribution centered at 512 bytes and background traffic a Poisson-like distribution centered at 1024 bytes. The proof is fully machine-checked in EasyCrypt.
From 2025-pereira-position — Position Paper: A Case for Machine-Checked Verification of Circumvention Systems · §4.2 · 2025 · Free and Open Communications on the Internet
Implications
- Avoid any pluggable transport whose packet-size distribution is statistically separable from background traffic — even if SNI is hidden, the size profile alone can anchor a conjunctive classifier with near-zero false positives.
- Domain-fronting schemes like meek must couple front-domain rotation with active traffic shaping (padding, fragmentation) to break the normal-distribution fingerprint; SNI privacy alone is insufficient.
Tags
Extracted by claude-sonnet-4-6 — review before relying.