Achieving subspace or key security for WOA using natural or circular watermarking

This paper presents two watermarking schemes that are secure when considering the Watermarked content Only Attack (WOA) framework. The definition of watermark security is first recalled and the distinction between key-security and subspace- security classes for Spread Spectrum (SS) watermarking schemes is presented afterwards. Blind source separation techniques are also recalled as a tool to assess the security of a SS watermarking scheme and prove that classical SS and Improved SS are not secure within the WOA framework. To further illustrate these security issues, we next build on a new watermarking scheme called Natural Watermarking (NW). We prove it to be subspace-secure under specific hypotheses. Natural watermarking does not change the Gaussian natural distributions of the projection of each carriers. Furthermore NWprevents estimations both of the watermark subspace (subspace-security) and the different carriers (key-security). We then extend the nice properties of NW to derive the more general family of Circular Watermarking schemes which are key-secure and may offer a better robustness to AWGN attack than NW. An implementation of CW based on ISS is next proposed and comparison of bit error rates for NW, CW, SS and ISS finally draws some conclusions on the robustness cost to achieve security.

[1]  Henrique S. Malvar,et al.  Improved spread spectrum: a new modulation technique for robust watermarking , 2003, IEEE Trans. Signal Process..

[2]  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.

[3]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[4]  Jean-Luc Dugelay,et al.  Danger of low-dimensional watermarking subspaces , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Aapo Hyvärinen,et al.  Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.

[6]  Fernando Pérez-González,et al.  Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum Analysis , 2005, Information Hiding.

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

[8]  Ton Kalker,et al.  Considerations on watermarking security , 2001, 2001 IEEE Fourth Workshop on Multimedia Signal Processing (Cat. No.01TH8564).

[9]  Fernando Pérez-González,et al.  Information-Theoretic Analysis of Security in Side-Informed Data Hiding , 2005, Information Hiding.

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Teddy Furon,et al.  Watermarking security part two: Practice , 2005, IS&T/SPIE Electronic Imaging.

[12]  Donald E. Knuth The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[13]  Teddy Furon,et al.  Watermarking security part one: Theory , 2005, IS&T/SPIE Electronic Imaging.

[14]  François Cayre,et al.  Natural Watermarking: A Secure Spread Spectrum Technique for WOA , 2006, Information Hiding.

[15]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[16]  Ingemar J. Cox,et al.  Applying informed coding and embedding to design a robust high-capacity watermark , 2004, IEEE Transactions on Image Processing.