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.
CITATION STYLE
Zöllner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., … Wolf, G. (1998). Modeling the security of steganographic systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1525, pp. 344–354). Springer Verlag. https://doi.org/10.1007/3-540-49380-8_24
Mendeley helps you to discover research relevant for your work.