Skip to main content

Practical Data-Hiding: Additive Attacks Performance Analysis

  • Conference paper
Digital Watermarking (IWDW 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3710))

Included in the following conference series:

  • 1963 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Somekh-Baruch, A., Merhav, N.: On the error exponent and capacity games of private watermarking systems. IEEE Trans. on Information Theory 49(3), 537–562 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barni, M., Bartolini, F.: Watermarking Systems Engineering. Marcel Dekker, Inc., New York (2004)

    Google Scholar 

  3. Chen, B., Wornell, G.W.: Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. IEEE Trans. on Information Theory 47, 1423–1443 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Comesaña-Alfaro, P., Pérez-Freire, L., Pérez-González, F.: An information-theoretic framework for assessing security in practical watermarking and data hiding scenarios. In: WIAMIS 2005, 6th International Workshop on Image Analysis for Multimedia Interactive Services, Montreux, Switzerland, April 13-15 (2005)

    Google Scholar 

  5. Costa, M.: Writing on dirty paper. IEEE Trans. on Information Theory 29(3), 439–441 (1983)

    Article  MATH  Google Scholar 

  6. Eggers, J.J., Bäuml, R., Tzschoppe, R., Girod, B.: Scalar costa scheme for information embedding. IEEE Transactions on Signal Processing 51(4), 1003–1019 (2003)

    Article  MathSciNet  Google Scholar 

  7. Erez, U., Zamir, R.: Lattice decoding can achieve 0.5 log(1+snr) over the additive white gaussian noise channel using nested codes. In: Proceedings of IEEE International Symposium on Information Theory, Washington DC, USA, June 2001, p. 125 (2001)

    Google Scholar 

  8. Gel’fand, S.I., Pinsker, M.S.: Coding for channel with random parameters. Problems of Control and Information Theory 9(1), 19–31 (1980)

    MATH  MathSciNet  Google Scholar 

  9. Goteti, A.K., Moulin, P.: Qim watermarking games. In: Proc. ICIP (October 2004)

    Google Scholar 

  10. McKellips, A., Verdu, S.: Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence. IEEE Transactions on Information Theory 43(4), 1256–1264 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Moulin, P., Ivanovic, A.: The zero-rate spread-spectrum watermarking game. IEEE Transactions on Signal Processing 51(4), 1098–1117 (2003)

    Article  MathSciNet  Google Scholar 

  12. Moulin, P., O’Sullivan, J.: Information-theoretic analysis of information hiding. IEEE Trans. on Information Theory 49(3), 563–593 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Peréz-Freire, L., Peréz-González, F., Voloshynovskiy, S.: Revealing the true achievable rates of scalar costa scheme. In: IEEE International Workshop on Multimedia Signal Processing (MMSP), Siena, Italy, September 29 - October 1 (2004)

    Google Scholar 

  14. Peréz-González, F., Balado, F., Hernández, J.R.: Performance analysis of existing and new methods for data hiding with known-host information in additive channels. IEEE Trans. on Signal Processing, Special Issue on Signal Processing for Data Hiding in Digital Media and Secure Content Delivery 51(4) (April 2003)

    Google Scholar 

  15. Pérez-González, F.: The importance of aliasing in structured quantization modulation data hiding. In: International Workshop on Digital Watermarking, Seoul, Korea (2003)

    Google Scholar 

  16. Somekh-Baruch, A., Merhav, N.: On the capacity game of public watermarking systems. IEEE Trans. on Information Theory 49(3), 511–524 (2004)

    Article  MathSciNet  Google Scholar 

  17. Topak, E., Voloshynovskiy, S., Koval, O., Mihcak, M.K., Pun, T.: Towards geometrically robust data-hiding with structured codebooks. In: ACM Multimedia Systems Journal, Special Issue on Multimedia and Security (2005) (submitted)

    Google Scholar 

  18. Tzschoppe, R., Bäuml, R., Fischer, R., Kaup, A., Huber, J.: Additive Non-Gaussian Attacks on the Scalar Costa Scheme (SCS). In: Proceedings of SPIE Photonics West, Electronic Imaging 2005, Security, Steganography, and Watermarking of Multimedia Contents VII (EI120), San Jose, USA, January 16-20, vol. 5681 (2005)

    Google Scholar 

  19. Vila-Forcén, J.E., Voloshynovskiy, S., Koval, O., Peréz-González, F., Pun, T.: Worst case additive attack against quantization-based watermarking techniques. In: IEEE International Workshop on Multimedia Signal Processing (MMSP), Siena, Italy, September 29 - October 1 (2004)

    Google Scholar 

  20. Vila-Forcén, J.E., Voloshynovskiy, S., Koval, O., Peréz-González, F., Pun, T.: Worst case additive attack against quantization-based data-hiding methods. In: Proceedings of SPIE Photonics West, Electronic Imaging 2005, Security, Steganography, and Watermarking of Multimedia Contents VII (EI120), San Jose, USA, January 16-20 (2005)

    Google Scholar 

  21. Voloshynovskiy, S., Deguillaume, F., Koval, O., Pun, T.: Information-theoretic data-hiding: Recent achievements and open problems. International Journal of Image and Graphics 5(1), 1–31 (2005)

    Article  Google Scholar 

  22. Voloshynovskiy, S., Koval, O., Topak, E., Vila-Forcén, J.E., Comesaña, P., Pun, T.: On reversibility of random binning techniques: multimedia perspectives. In: Dittmann, J., Katzenbeisser, S., Uhl, A. (eds.) CMS 2005. LNCS, vol. 3677, pp. 108–118. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Voloshynovskiy, S., Pereira, S., Iquise, V., Pun, T.: Attack modelling: Towards a second generation benchmark. Signal Processing 81(6), 1177–1214 (2001); Special Issue: Information Theoretic Issues in Digital Watermarking. In: Cappellini, V., Barni, M., Bartolini, F. (eds.) (2001)

    Google Scholar 

  24. Voloshynovskiy, S., Pereira, S., Pun, T., Eggers, J., Su, J.: Attacks on digital watermarks: Classification, estimation-based attacks and benchmarks. IEEE Communications Magazine (Special Issue on Digital watermarking for copyright protection: a communications perspective) 39(8), 118–127 (2001); Barni, M., Bartolini, F., Cox, I.J., Hernandez, J., Pérez-González, F. (Guest eds.) (Invited paper)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vila-Forcén, J.E., Voloshynovskiy, S., Koval, O., Pérez-González, F., Pun, T. (2005). Practical Data-Hiding: Additive Attacks Performance Analysis. In: Barni, M., Cox, I., Kalker, T., Kim, HJ. (eds) Digital Watermarking. IWDW 2005. Lecture Notes in Computer Science, vol 3710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551492_19

Download citation

  • DOI: https://doi.org/10.1007/11551492_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28768-1

  • Online ISBN: 978-3-540-32052-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics