Additive non-Gaussian noise attacks on the scalar Costa scheme (SCS)

Conference contribution
(Conference Contribution)

Publication Details

Author(s): Tzschoppe R, Bäuml R, Fischer R, Huber J, Kaup A
Editor(s): Delp III E.J.; Wong P.W.
Publication year: 2005
Volume: 5681
Pages range: 114-123


The additive attack public mutual information game is explicitly solved for one of the simplest quantization based watermarking schemes, the scalar Costa scheme (SCS). It is a zero-sum game played between the embedder and the attacker, and the payoff function is the mutual information.. The solution of the game, a subgame perfect nash equilibrium, is found by backward induction. Therefore, the Blahut-Arimoto algorithm is employed for numerically optimizing the mutual information over noise distributions. Although the worst case distribution is in general strongly non-Gaussian, the capacity degradation compared to a suboptimal Gaussian noise attack is quite small. The loss, if the embedder optimizes SCS for a Gaussian attack but the worst case attack is employed, is negligible. © 2005 SPIE and IS&T.

FAU Authors / FAU Editors

Kaup, André Prof. Dr.-Ing.
Lehrstuhl für Multimediakommunikation und Signalverarbeitung

How to cite

Tzschoppe, R., Bäuml, R., Fischer, R., Huber, J., & Kaup, A. (2005). Additive non-Gaussian noise attacks on the scalar Costa scheme (SCS). In Delp III E.J.; Wong P.W. (Eds.), (pp. 114-123). San Jose, CA, US.

Tzschoppe, Roman, et al. "Additive non-Gaussian noise attacks on the scalar Costa scheme (SCS)." Proceedings of the Proceedings of SPIE-IS and T Electronic Imaging - Security, Steganography, and Watermarking of Multimedia Contents VII, San Jose, CA Ed. Delp III E.J.; Wong P.W., 2005. 114-123.


Last updated on 2018-23-12 at 13:50