FINDING · DEFENSE

The paper proposes modeling HCS undetectability as a simulation-based cryptographic distinguishability problem: if traces produced by the real-world HCS channel are computationally indistinguishable from ideal-world application-channel traces (T_HCS ∼ T_simulator), the HCS achieves provable security against any adversary — passive or active. The simulation paradigm is parametric in adversary capability, meaning a single proof covers the full spectrum from passive SNI monitoring to active DPI.

From 2025-pereira-positionPosition Paper: A Case for Machine-Checked Verification of Circumvention Systems · §1, §2 · 2025 · Free and Open Communications on the Internet

Implications

Tags

techniques
dpitraffic-shapeactive-probing
defenses
meta-resistance

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