Topological study and Lyapunov exponent of a secure steganographic scheme

TL;DR

This paper analyzes the topological security of the CIS2 steganographic scheme, demonstrating its robustness against various attack models through topological and Lyapunov exponent analysis.

Contribution

It extends the understanding of CIS2's security by modeling it as real-line iterations and examining its Lyapunov exponent, revealing its resilience against advanced attacks.

Findings

CIS2 is topologically secure against multiple attack types

The scheme's Lyapunov exponent indicates stability and robustness

CIS2 can effectively deter malicious attackers in estimated original attacks

Abstract

CIS2 is a steganographic scheme proposed in the information hiding literature, belonging into the small category of algorithms being both stego and topologically secure. Due to its stego-security, this scheme is able to face attacks that take place into the "watermark only attack" framework. Its topological security reinforce its capability to face attacks in other frameworks as "known message attack" or "known original attack", in the Simmons' prisoner problem. In this research work, the study of topological properties of C I S 2 is enlarged by describing this scheme as iterations over the real line, and investigating other security properties of topological nature as the Lyapunov exponent. Results show that this scheme is able to withdraw a malicious attacker in the "estimated original attack" context too.