Chaotic iterations for steganography: Stego-security and topological-security

2011/12/16 by Nicolas Friot, Christophe Guyeux, Friot, Nicolas +3
Computer Science · Mathematics · #Advanced Steganography and Watermarking Techniques #Chaos-based Image/Signal Encryption #Mathematical Dynamics and Fractals #cs.CR #cs.MM #math.DS #math.GN

paper · pdf · doi:10.48550/arxiv.1112.3873

15 pages; 3 figures; SECRYPT 2011: International Conference on Security and Cryptography, Seville, Spain, 18-21 July

arxiv created 2011/12/16 · arxiv updated 2011/12/19

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.

Related

• Steganography: a Class of Algorithms having Secure Properties
• Steganography: a class of secure and robust algorithms
• Application of Steganography for Anonymity through the Internet
• Chaotic iterations versus Spread-spectrum: topological-security and stego-security
• A watermarking algorithm satisfying topological chaos properties