Attack modelling: towards a second generation watermarking benchmark
Signal Processing - Special section on information theoretic aspects of digital watermarking
Watermarking Systems Engineering (Signal Processing and Communications, 21)
Watermarking Systems Engineering (Signal Processing and Communications, 21)
On reversibility of random binning techniques: multimedia perspectives
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Scalar Costa scheme for information embedding
IEEE Transactions on Signal Processing
The zero-rate spread-spectrum watermarking game
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the error exponent and capacity games of private watermarking systems
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
On the capacity game of public watermarking systems
IEEE Transactions on Information Theory
Attacks on digital watermarks: classification, estimation based attacks, and benchmarks
IEEE Communications Magazine
A Bootstrap Attack on Digital Watermarks in the Frequency Domain
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
| Hi-index | 0.00 |
The main goal of this tutorial is to review the theory and design the worst case additive attack (WCAA) for $\mid{\mathcal{M}}\mid$-ary quantization-based data-hiding methods using as performance criteria the error probability and the maximum achievable rate of reliable communications. Our analysis focuses on the practical scheme known as distortion compensation dither modulation (DC-DM). From the mathematical point of view, the problem of the worst case attack (WCA) design using probability of error as a cost function is formulated as the maximization of the average probability of error subject to the introduced distortion for a given decoding rule. When mutual information is selected as a cost function, a solution to the minimization problem should provide such an attacking noise probability density function (pdf) that will maximally decrease the rate of reliable communications for an arbitrary decoder structure. The obtained results demonstrate that, within the class of additive attacks, the developed attack leads to a stronger performance decrease for the considered class of embedding techniques than the additive white Gaussian or uniform noise attacks.