Date Added: Mar 2012
In the authors' previous researches, a new digital watermarking scheme based on chaotic iterations has been introduced. This scheme was both stego-secure and topologically secure. The stego-security is to face an attacker in the watermark only attack category, whereas the topological security concerns other categories of attacks. Its Lyapunov exponent is evaluated here, to quantify the chaos generated by this scheme. It currently exists only three data hiding schemes being both stego-secure and topologically secure. This paper is organized as follows. Some basic reminders are given. The semiconjugacy allowing the exponent evaluation is described. In the next one, the exponent is evaluated. This paper ends by a conclusion section where their contribution is summarized.