2000 character limit reached
A Complexity Approach for Steganalysis
Published 22 Dec 2011 in cs.CR and cs.CC | (1112.5245v1)
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.
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.