FINDING · DEFENSE
Hash-based covert carrier filtering reduces ML classifier AUC for network storage covert channels from 1.0 (no filtering, L=0) to well below 0.7 when filter key size L≥6; SVM detection approaches random-guessing levels. The strategy selects a sparse, pseudo-random 1/2^L subset of packets as covert carriers using SHA-256 keyed by a pre-shared secret, diluting statistical anomalies in header field modifications with a large volume of unmodified legitimate packets.
From 2026-zou-hiding-trees-forest — Hiding the Trees in the Forest: Building Network Covert Channels with Hash-Based Covert Carrier Filtering · §5.3.2, Fig.6 · 2026 · arXiv preprint
Implications
- Use a filter key size of at least 6 bits (~1.56% carrier selection rate) to make header-field modification patterns statistically indistinguishable from normal traffic under SVM, Random Forest, and XGBoost classifiers.
- Couple carrier selection to a pre-shared key rather than a fixed embedding algorithm so that even if the obfuscation scheme is known, an adversary faces exhaustive key search rather than pattern recognition.
Tags
Extracted by claude-sonnet-4-6 — review before relying.