Open Access

Breaking the BOWS Watermarking System: Key Guessing and Sensitivity Attacks

EURASIP Journal on Information Security20072007:025308

https://doi.org/10.1155/2007/25308

Received: 11 May 2007

Accepted: 31 August 2007

Published: 25 December 2007

Abstract

From December 15, 2005 to June 15, 2006, the watermarking community was challenged to remove the watermark from 3 different 512×512 watermarked images while maximizing the peak signal-to-noise ratio (PSNR) measured by comparing the watermarked signals with their attacked counterparts. This challenge, which bore the inviting name of Break Our Watermarking System (BOWS), had as its main objective to enlarge the current knowledge on attacks to watermarking systems. In this paper, the main results obtained by the authors when attacking the BOWS system are presented and compared with strategies followed by other groups. Essentially, two different approaches have been followed: exhaustive search of the secret key and blind sensitivity attacks.

[12345678910111213]

Authors’ Affiliations

(1)
Signal Theory and Communications Department, University of Vigo

References

  1. http://lci.det.unifi.it/BOWS/
  2. Westfeld A: Lessons from the BOWS contest. Proceedings of the 8th Workshop on Multimedia and Security , September 2006, Geneva, Switzerland 208-213.Google Scholar
  3. Comesaña P, Pérez-Freire L, Pérez-González F: Blind newton sensitivity attack. IEE Proceedings on Information Security 2006, 153(3):115-125. 10.1049/ip-ifs:20055151View ArticleGoogle Scholar
  4. Westfeld A: Tackling bows with the sensitivity attack. In Security, Steganography and Watermarking of Multimedia Contents IX, January 2007, San Jose, Calif, USA, Proceedings of SPIE Edited by: Delp EJ III, Wong PW. 6505: 11 pages.View ArticleGoogle Scholar
  5. Craver S, Atakli I, Yu J: How we broke the bows watermark. In Security, Steganography and Watermarking of Multimedia Contents IX, January 2007, San Jose, Calif, USA, Proceedings of SPIE Edited by: Delp EJ III, Wong PW. 6505: 8 pages.Google Scholar
  6. Le Guelvouit G, Furon T, Cayre F: The good, the bad, and the ugly: three different approaches to break their watermarking system. In Security, Steganography and Watermarking of Multimedia Contents IX, January 2007, San Jose, Calif, USA, Proceedings of SPIE Edited by: Delp EJ III, Wong PW. 6505: 8 pages.View ArticleGoogle Scholar
  7. Miller ML, Doërr GJ, Cox IJ: Applying informed coding and embedding to design a robust high-capacity watermark. IEEE Transactions on Image Processing 2004, 13(6):792-807. 10.1109/TIP.2003.821551View ArticleGoogle Scholar
  8. http://www.adastral.ucl.ac.uk/~gwendoer/dptWatermarking/
  9. Earl JW: Tangential sensitivity analysis of watermarks using prior information. In Security, Steganography and Watermarking of Multimedia Contents IX, January 2007, San Jose, Calif, USA, Proceedings of SPIE Edited by: Delp EJ III, Wong PW. 6505: 12 pages.View ArticleGoogle Scholar
  10. Nocedal J, Wright SJ: Numerical Optimization. Springer, New York, NY, USA; 1999.MATHView ArticleGoogle Scholar
  11. Bertsekas DP: Nonlinear Programming. Athena Scientific, Nashua, NH, USA; 1995.MATHGoogle Scholar
  12. Barni M, Pérez-González F, Comesaña P, Bartoli G: Putting reproducible signal processing into practice: a case study in watermarking. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '07), April 2007, Honolulu, Hawaii, USA 4: 1261-1264.Google Scholar
  13. Pateux S, Le Guelvouit G: Practical watermarking scheme based on wide spread spectrum and game theory. Signal Processing: Image Communication 2003, 18(4):283-296. 10.1016/S0923-5965(02)00145-5Google Scholar

Copyright

© P. Comesaña and F. Pérez-González. 2007

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.