FINDING · DETECTION
Combining a CNN flow classifier with host-based temporal accumulation eliminates all false positive classifications after observing at most 38 flows per host while maintaining perfect recall for all obfs4 and obfs⋆ bridges. The scheme requires only 14 bits of state per (IP, port) pair; tracking 4×10⁹ destination services requires no more than 50 GiB of storage, feasible on commodity hardware.
From 2024-wails-precisely — On Precisely Detecting Censorship Circumvention in Real-World Networks · §VI-A–B, Algorithm 1, Table VI · 2024 · Network and Distributed System Security
Implications
- Any circumvention protocol that reuses a fixed (IP, port) proxy endpoint will be identified with zero false positives after ~38 flows regardless of per-flow obfuscation quality; proxy IP:port pairs must be rotated before that flow count accumulates.
- Adopt ephemeral proxy infrastructure (e.g., Snowflake-style volunteer proxies) or WATER/WASM per-session server randomization so no single (IP, port) pair ever receives enough flows to cross the confidence threshold.
Tags
Extracted by claude-sonnet-4-6 — review before relying.