# Provably Robust and Secure Steganography in Asymmetric Resource Scenario

arXiv: https://arxiv.org/abs/2407.13499 · HTML: https://mlsanity.com/paper/2407.13499/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Jul 2024.

## Built on by (most cited first, 6 of 6)

- [Anchored Sliding Window: Toward Robust and Imperceptible Linguistic Steganography](https://mlsanity.com/paper/2604.09066/) (2026)
- [Robust Provably Secure Image Steganography via Latent Iterative Optimization](https://mlsanity.com/paper/2603.09348/) (2026)
- [ACF: A Collaborative Framework for Agent Covert Communication under Cognitive Asymmetry](https://mlsanity.com/paper/2604.08276/) (2026)
- [PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution](https://mlsanity.com/paper/2608.22218/) (2026)
- [A Comprehensive Survey on Linguistic Steganography: Methods, Countermeasures, Evaluation, and Challenges](https://mlsanity.com/paper/2608.29077/) (2026)
- [Codetta: High-Capacity, Keyless, and Undetectable Multi-Agent Collusion](https://mlsanity.com/paper/2609.28900/) (2026)

## Abstract (arXiv)

To circumvent the unbridled and ever-encroaching surveillance and censorship in cyberspace, steganography has garnered attention for its ability to hide private information in innocent-looking carriers. Current provably secure steganography approaches require a pair of encoder and decoder to hide and extract private messages, both of which must run the same model with the same input to obtain identical distributions. These requirements pose significant challenges to the practical implementation of steganography, including limited access to powerful hardware and the intolerance of any changes to the shared input. To relax the limitation of hardware and solve the challenge of vulnerable shared input, a novel and practically significant scenario with asymmetric resource should be considered, where only the encoder is high-resource and accessible to powerful models while the decoder can only read the steganographic carriers without any other model's input. This paper proposes a novel provably robust and secure steganography framework for the asymmetric resource setting. Specifically, the encoder uses various permutations of distribution to hide secret bits, while the decoder relies on a sampling function to extract the hidden bits by guessing the permutation used. Further, the sampling function only takes the steganographic carrier as input, which makes the decoder independent of model's input and model itself. A comprehensive assessment of applying our framework to generative models substantiates its effectiveness. Our implementation demonstrates robustness when transmitting over binary symmetric channels with errors.