Steganography: A Class of Secure and Robust Algorithms
This research work presents a new class of non-blind information hiding algorithms that are stego secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach the authors prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains. This paper focus on non-blind binary information hiding chaotic schemes: the original host is required to extract the binary hidden information. This context is indeed not as restrictive as it could primarily appear. Firstly, it allows to prove the authenticity of a document sent through the Internet.