Practical Data-Hiding: Additive Attacks Performance Analysis

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.

[1]  Fernando Pérez-González,et al.  AN INFORMATION-THEORETIC FRAMEWORK FOR ASSESSING SECURITY IN PRACTICAL WATERMARKING AND DATA HIDING SCENARIOS , 2005 .

[2]  Fernando Pérez-González,et al.  Worst case additive attack against quantization-based watermarking techniques , 2004, IEEE 6th Workshop on Multimedia Signal Processing, 2004..

[3]  Pierre Moulin,et al.  QIM watermarking games , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[4]  Fernando Pérez-González The Importance of Aliasing in Structured Quantization Index Modulation Data Hiding , 2003, IWDW.

[5]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[6]  Sergio Verdú,et al.  Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence , 1997, IEEE Trans. Inf. Theory.

[7]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[8]  Thierry Pun,et al.  Towards geometrically robust data-hiding with structured codebooks , 2005, Multimedia Systems.

[9]  Thierry Pun,et al.  Information-theoretic Data-hiding: Recent Achievements and Open Problems 5 , 2004 .

[10]  Thierry Pun,et al.  On Reversibility of Random Binning Techniques: Multimedia Perspectives , 2005, Communications and Multimedia Security.

[11]  Fernando Pérez-González,et al.  Worst-case additive attack against quantization-based data-hiding methods , 2005, IS&T/SPIE Electronic Imaging.

[12]  Bernd Girod,et al.  Scalar Costa scheme for information embedding , 2003, IEEE Trans. Signal Process..

[13]  Uri Erez,et al.  Lattice Decoding Can Achieve on the AWGN Channel using Nested Codes , 2001 .

[14]  Mauro Barni,et al.  Watermarking Systems Engineering (Signal Processing and Communications, 21) , 2004 .

[15]  N. Merhav,et al.  On the capacity game of public watermarking systems , 2002, Proceedings IEEE International Symposium on Information Theory,.

[16]  Thierry Pun,et al.  Attack modelling: towards a second generation watermarking benchmark , 2001, Signal Process..

[17]  Fernando Pérez-González,et al.  Revealing the true achievable rates of scalar Costa scheme , 2004, IEEE 6th Workshop on Multimedia Signal Processing, 2004..

[18]  Robert F. H. Fischer,et al.  Additive non-Gaussian noise attacks on the scalar Costa scheme (SCS) , 2005, IS&T/SPIE Electronic Imaging.

[19]  Thierry Pun,et al.  Attack modelling : towards a second generation benchmark , 2001 .

[20]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

[21]  R. Zamir,et al.  Lattice decoding can achieve 1/2 log(1+SNR) on the AWGN channel using nested codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[22]  S. Pereira,et al.  Attacks on digital watermarks: classification, estimation based attacks, and benchmarks , 2001, IEEE Communications Magazine.

[23]  Fernando Pérez-González,et al.  Performance analysis of existing and new methods for data hiding with known-host information in additive channels , 2003, IEEE Trans. Signal Process..

[24]  Neri Merhav,et al.  On the error exponent and capacity games of private watermarking systems , 2003, IEEE Trans. Inf. Theory.

[25]  Pierre Moulin,et al.  The zero-rate spread-spectrum watermarking game , 2003, IEEE Trans. Signal Process..