Lyapunov exponent evaluation of a digital watermarking scheme proven to be secure
This work provides a quantitative measure of chaos for a secure digital watermarking scheme, which is incremental as it builds on prior security proofs without addressing new problems.
The authors evaluated the Lyapunov exponent of a previously introduced digital watermarking scheme based on chaotic iterations to quantify the chaos generated, which was already proven to be stego-secure and topologically secure.
In our 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. Keywords : Lyapunov exponent; Information hiding; Security; Chaotic iterations; Digital Watermarking.