A Complexity Approach for Steganalysis

TL;DR

This paper introduces a novel complexity-based framework for steganalysis, establishing a rigorous notion of secure hiding and presenting an initial secure hiding scheme inspired by complexity theory.

Contribution

It proposes a new theoretical approach to steganalysis based on complexity theory, defining secure hiding and providing the first scheme demonstrating this concept.

Findings

Defined a notion of secure hiding in steganalysis

Proposed the first secure hiding scheme based on complexity theory

Established a rigorous framework analogous to cryptographic security

Abstract

In this proposal for the Journ\`ees Codes et St\'eganographie 2012, we define a new rigorous approach for steganalysis based on the complexity theory. It is similar to the definitions of security that can be found for hash functions, PRNG, and so on. We propose here a notion of \emph{secure hiding} and we give a first secure hiding scheme.