Robust Provably Secure Image Steganography via Latent Iterative Optimization
Organizations: School of Cyber Science and Engineering, Wuhan University · Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education
Abstract
We propose a robust and provably secure image steganography framework based on latent-space iterative optimization. Within this framework, the receiver treats the transmitted image as a fixed reference and iteratively refines a latent variable to minimize the reconstruction error, thereby improving message extraction accuracy. Unlike prior methods, our approach preserves the provable security of the embedding while markedly enhancing robustness under various compression and image processing scenarios. On benchmark datasets, the experimental results demonstrate that the proposed iterative optimization not only improves robustness against image compression while preserving provable security, but can also be applied as an independent module to further reinforce robustness in other provably secure steganographic schemes. This highlights the practicality and promise of latent-space optimization for building reliable, robust, and secure steganographic systems.
Figures & tables
| Method | TIFF32 | TIFF16 | PNG | JPEG90 | JPEG70 | JPEG50 |
|---|---|---|---|---|---|---|
| Hu | 0.9830 | 0.9820 | 0.9805 | 0.9634 | 0.9235 | 0.8887 |
| Ours | 0.9354 | 0.9349 | 0.9288 | 0.9118 | 0.8776 | 0.8421 |
| Ours (Opt) | 0.9877 | 0.9876 | 0.9854 | 0.9683 | 0.9272 | 0.8820 |
Latent Space Optimization
Latent space optimization searches learned, compressed representations to make difficult design and generation problems easier to optimize.
See all 40 papers