Chaotic iterations for steganography: Stego-security and topological-security
Nicolas Friot, Christophe Guyeux, and Jacques M. Bahi

TL;DR
This paper introduces a new steganographic method based on chaotic iterations that achieves high security levels against watermark-only attacks and exhibits topological security properties to counter various attack categories.
Contribution
The paper presents a novel chaotic iteration-based steganographic scheme that is both stego-secure and topologically secure, advancing security measures in information hiding.
Findings
Scheme is stego-secure against watermark-only attacks
Scheme exhibits topological security properties
First to address multiple attack categories with topological security
Abstract
In this paper is proposed a novel steganographic scheme based on chaotic iterations. This research work takes place into the information hiding security fields. We show that the proposed scheme is stego-secure, which is the highest level of security in a well defined and studied category of attack called "watermark-only attack". Additionally, we prove that this scheme presents topological properties so that it is one of the firsts able to face, at least partially, an adversary when considering the others categories of attacks defined in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption · Mathematical Dynamics and Fractals
