Modeling the Security of Steganographic Systems

We present a model of steganographic systems which allows to evaluate their security. We especially want to establish an analogy to the known-plaintext-attack which is commonly used to rate cryptographic systems. This model's main statement is that the embedding operation of a steganographic system should work indeterministic from the attacker's point of view. This is proved by means of information theory.