Steganography: a Class of Algorithms having Secure Properties

2011/12/07 by Jacques M. Bahi, Bahi, Jacques M., Jean-François Couchot +3 · 1 citation
Computer Science · #Advanced Steganography and Watermarking Techniques #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CR #cs.DM

paper · pdf · doi:10.48550/arxiv.1112.1675

4 pages, published in Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2011, Dalian, China, October 14-16, 2011

arxiv created 2011/12/07 · openalex publication_date 2011/12/07 · arxiv updated 2011/12/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustness, or security, is rarely elucidated. This research work presents a new class of non-blind information hidingalgorithms based on some finite domains iterations that are Devaney's topologically chaotic. The approach is entirely formalized and reasons to take place into the mathematical theory of chaos are explained. Finally, stego-security and chaos security are consequently proven for a large class of algorithms.

Cited by

• A Cryptographic Approach for Steganography

Related

• Steganography: a class of secure and robust algorithms
• Chaotic iterations for steganography: Stego-security and topological-security
• A chaos-based approach for information hiding security
• Chaotic iterations versus Spread-spectrum: topological-security and stego-security
• Chaotic iterations versus Spread-spectrum: chaos and stego security