Lyapunov exponent evaluation of a digital watermarking scheme proven to be secure

TL;DR

This paper evaluates the Lyapunov exponent of a chaotic digital watermarking scheme to quantify its security-related chaotic behavior, building on prior work that proved its stego- and topological security.

Contribution

It provides a quantitative measure of chaos via Lyapunov exponent for a previously proposed secure digital watermarking scheme based on chaotic iterations.

Findings

Lyapunov exponent confirms high chaos levels in the scheme

The scheme maintains security against various attack categories

Quantitative analysis supports the scheme's robustness

Abstract

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.