Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 53 min ago
PreprintarXiv licencearXiv

The Transmitter Trojan Channel: Achievable Rates and Error Exponents

Abstract

Experiments have shown that modifications in communication hardware can enable unauthorized exfiltration of data from transmitters. We study the resulting Transmitter Trojan channel, in which a malicious encoder embedded within a legitimate transmitter perturbs the transmitted codeword on a symbol-by-symbol basis. The model reflects the limited footprint, delay, and computational complexity available to such hardware modifications. We derive achievable rogue message rate and achievable rates for the legitimate message under the mismatch induced by the Trojan. We also analyze decoding error exponents for the legitimate and rogue receivers, including operational exponent lower bounds obtained through channel-resolvability transfer arguments. Finally, we study Trojan detection at the legitimate receiver under different levels of statistical knowledge, including likelihood-ratio detection when the ensemble-averaged induced channel is known and goodness-of-fit detection when only the nominal channel is known. The resulting detection error exponents, together with the achievable rate and decoding error exponents, quantify tradeoffs among rogue message rate, legitimate message rate, decoding reliability, and Trojan detectability. We specialize the analysis to the binary symmetric channel and the additive white Gaussian noise channel, and illustrate the resulting tradeoffs numerically.

Related

  1. Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
    Prachi Mishra, Sidharth Jaggi, Navin Kashyap +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Achievable Rate Region Characterization of Rotatable Antenna-assisted Interference Channel
    Junran Pei, Guangji Chen, Qingqing Wu +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information
    Amos Lapidoth, Baohua Ni
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Rarity Determines Minimax Rates of Semantic Entropy From Weak Pairwise Judgments With a Known Channel
    Xiaoli Yu, Jiamiao Liu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Receiver-Informed Transmitter for 200Gbps C-Band Direct-Detection PON With FFE-Free ONU
    Safiya Dabwan, Geraldo Gomes, Stylianos Sygletos
    arXivPreprintCC BY 4.0Full textGeneral mathematicsOptics & photonicsarXiv
BibTeX
@misc{farahnakghazani2026transmitter,
  title = {{The Transmitter Trojan Channel: Achievable Rates and Error Exponents}},
  author = {Maryam Farahnak-Ghazani and Aria Nosratinia},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32074},
  eprint = {2609.32074},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32074},
}
RIS
TY  - UNPB
TI  - The Transmitter Trojan Channel: Achievable Rates and Error Exponents
AU  - Maryam Farahnak-Ghazani
AU  - Aria Nosratinia
PY  - 2026
DA  - 2026/09/25
PB  - arXiv
DO  - 10.48550/arxiv.2609.32074
UR  - https://arxiv.org/abs/2609.32074
AB  - Experiments have shown that modifications in communication hardware can enable unauthorized exfiltration of data from transmitters. We study the resulting Transmitter Trojan channel, in which a malicious encoder embedded within a legitimate transmitter perturbs the transmitted codeword on a symbol-by-symbol basis. The model reflects the limited footprint, delay, and computational complexity available to such hardware modifications. We derive achievable rogue message rate and achievable rates for the legitimate message under the mismatch induced by the Trojan. We also analyze decoding error exponents for the legitimate and rogue receivers, including operational exponent lower bounds obtained through channel-resolvability transfer arguments. Finally, we study Trojan detection at the legitimate receiver under different levels of statistical knowledge, including likelihood-ratio detection when the ensemble-averaged induced channel is known and goodness-of-fit detection when only the nominal channel is known. The resulting detection error exponents, together with the achievable rate and decoding error exponents, quantify tradeoffs among rogue message rate, legitimate message rate, decoding reliability, and Trojan detectability. We specialize the analysis to the binary symmetric channel and the additive white Gaussian noise channel, and illustrate the resulting tradeoffs numerically.
ER  -