Turbo covert channel: An iterative framework for covert communication over data networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Inspired by the challenges of designing a robust, and undetectable covert channel, in this paper we introduce a design methodology for timing covert channels that achieve provable polynomial-time undetectability. This means that the covert channel can not be detected by any polynomial-time statistical test that analyzes the samples of the covert traffic and the legitimate traffic. The proposed framework is based on modeling the covert channel as a differential communication channel, and the formulation for modulation/demodulation processes that are derived according to the communication model. The proposed scheme incorporates a trellis structure in modulating the covert message. The trellis structure is also used at the covert receiver to perform iterative demodulation/decoding of the covert message that significantly enhances the channel reliability. In addition, the paper presents an adaptive modulation strategy that improves the channel robustness without compromising the stealthiness of the channel. The combination of the adaptive modulation and the trellis structure gives the covert channel considerable flexibility and low error rate at the covert receiver. In fact, performance analysis of the channel reveals that the proposed covert communication scheme withstands extremely high levels of network noise and adversarial disruption, while it maintains an outstanding undetectability level and covert rate.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it