Invertibility attack against watermarking based on forged algorithm and a countermeasure

It is shown in this paper that, even with a non-invertible watermarking algorithm or an asymmetric watermarking protocol, it is still possible to effect an invertibility attack, which relies on a forged watermarking algorithm, a counterfeit mark, and a fake key. Two examples are given to show the vulnerability of the unfortified non-invertible algorithm/asymmetric protocol. As a solution, a secure watermarking protocol is proposed, which establishes correlation between the watermarking algorithm and the embedded mark.

[1]  Frank Hartung,et al.  Multimedia watermarking techniques , 1999, Proc. IEEE.

[2]  S. Pereira,et al.  Attacks and Benchmarking , 2001 .

[3]  Gregory W. Wornell,et al.  Dither modulation: a new approach to digital watermarking and information embedding , 1999, Electronic Imaging.

[4]  Ahmed H. Tewfik,et al.  Multiresolution scene-based video watermarking using perceptual models , 1998, IEEE J. Sel. Areas Commun..

[5]  Sviatoslav Voloshynovskiy,et al.  Watermark copy attack , 2000, Electronic Imaging.

[6]  Stefan Katzenbeisser,et al.  Securing symmetric watermarking schemes against protocol attacks , 2002, IS&T/SPIE Electronic Imaging.

[7]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

[8]  Nasir D. Memon,et al.  On the invertibility of invisible watermarking techniques , 1997, Proceedings of International Conference on Image Processing.

[9]  Chin-Chen Chang,et al.  A watermarking technique based on one-way hash functions , 1999, IEEE Trans. Consumer Electron..