English

Multichannel Steganography: A Provably Secure Hybrid Steganographic Model for Secure Communication

Cryptography and Security 2025-07-08 v2 Multimedia

Abstract

Secure covert communication in hostile environments requires simultaneously achieving invisibility, provable security guarantees, and robustness against informed adversaries. This paper presents a novel hybrid steganographic framework that unites cover synthesis and cover modification within a unified multichannel protocol. A secret-seeded PRNG drives a lightweight Markov-chain generator to produce contextually plausible cover parameters, which are then masked with the payload and dispersed across independent channels. The masked bit-vector is imperceptibly embedded into conventional media via a variance-aware least-significant-bit algorithm, ensuring that statistical properties remain within natural bounds. We formalize a multichannel adversary model (MC-ATTACK) and prove that, under standard security assumptions, the adversary's distinguishing advantage is negligible, thereby guaranteeing both confidentiality and integrity. Empirical results corroborate these claims: local-variance-guided embedding yields near-lossless extraction (mean BER <5×103<5\times10^{-3}, correlation >0.99>0.99) with minimal perceptual distortion (PSNR 100\approx100,dB, SSIM >0.99>0.99), while key-based masking drives extraction success to zero (BER 0.5\approx0.5) for a fully informed adversary. Comparative analysis demonstrates that purely distortion-free or invertible schemes fail under the same threat model, underscoring the necessity of hybrid designs. The proposed approach advances high-assurance steganography by delivering an efficient, provably secure covert channel suitable for deployment in high-surveillance networks.

Keywords

Cite

@article{arxiv.2501.04511,
  title  = {Multichannel Steganography: A Provably Secure Hybrid Steganographic Model for Secure Communication},
  author = {Obinna Omego and Michal Bosy},
  journal= {arXiv preprint arXiv:2501.04511},
  year   = {2025}
}

Comments

22 pages, 15 figures, 4 algorithms. This version is a preprint uploaded to arXiv