2000 character limit reached
Lyapunov exponent evaluation of a digital watermarking scheme proven to be secure
Published 3 Mar 2012 in cs.CR, cs.MM, math.DS, and math.GN | (1203.0692v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.