On reversibility of random binning based data-hiding techniques: security perspectives

ABSTRACT

Reversibility of data-hiding refers to the reconstruction of original host data at the decoder from the stego data. Previous works on the subject are concentrated on the reversibility of data-hiding techniques from multimedia perspectives. However, from the security point of view, that at our knowledge was not exploited in existing studies, reversibility could be used by an attacker to remove the complete trace of watermark data from the stego data in the sense of designing the worst case attack. Thus, the aim of this paper is to analyze the reversibility of data-hiding techniques based on random binning from the security perspectives.

REFERENCES

• 1: M. E. Choubassi and P. Moulin. New sensitivity analysis attack. In E. J. Delp and P. W. Wong, editors, Security, Steganography, and Watermarking of Multimedia Contents, volume 5681 of Proceedings of SPIE, pages 734--745. SPIE, 2005.
• 2: P. Comesaña, L. Pérez-Freire, and F. Pérez-González. The return of the sensitivity attack. In M. Barni, I. J. Cox, T. Kalker, and H. J. Kim, editors, IWDW, volume 3710 of Lecture Notes in Computer Science, pages 260--274. Springer, 2005.
• 3: M. Costa. Writing on dirty paper. IEEE Trans. on Information Theory, 29(3):439--441, May 1983.
• 4: Thomas M. Cover , Joy A. Thomas, Elements of information theory, Wiley-Interscience, New York, NY, 1991
• 5: S. Gel'fand and M. Pinsker. Coding for channel with random parameters. Probl. Control and Inf. Theory, 9(1):19--31, 1980.
• 6: A. Kerckhoffs. La cryptographie militaire. Journal des sciences militaires, 9:5--38, 1883.
• 7: Jean-Paul M. G. Linnartz , Marten van Dijk, Analysis of the Sensitivity Attack against Electronic Watermarks in Images, Proceedings of the Second International Workshop on Information Hiding, p.258-272, April 14-17, 1998
• 8: Mehmet Kivanç Mihçak , Ramarathnam Venkatesan , Mustafa Kesal, Cryptanalysis of Discrete-Sequence Spread Spectrum Watermarks, Revised Papers from the 5th International Workshop on Information Hiding, p.226-246, October 07-09, 2002
• 9: C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656--715, October 1949.
• 10: E. Topak, S. Voloshynovskiy, O. Koval, M. Mihcak, and T. Pun. Towards geometrically robust data-hiding with structured codebooks. ACM Multimedia Systems Journal, Special Issue on Multimedia and Security, 11(2), 2005.
• 11: Sviatoslav Voloshynovskiy , Alexander Herrigel , Nazanin Baumgaertner , Thierry Pun, A Stochastic Approach to Content Adaptive Digital Image Watermarking, Proceedings of the Third International Workshop on Information Hiding, p.211-236, September 29-October 01, 1999
• 12: S. Voloshynovskiy, O. Koval, E. Topak, J. Vila-Forcén, P. Comesana, and T. Pun. On reversibility of random binning techniques: multimedia perspectives. In 9th IFIP TC-6 TC-11 Conference on Communications and Multimedia Security (CMS 2005), Salzburg, Austria, September 2005.
• 13: S. Voloshynovskiy, S. Pereira, A. Herrigel, N. Baumgärtner, and T. Pun. A generalized watermark attack based on stochastic watermark estimation and perceptual remodulation. In IS&T/SPIE's 12th Annual Symposium, Electronic Imaging 2000: Security and Watermarking of Multimedia Conteht II, volume 3951, pages 358--370, San Jose, California USA, 23-28 January 0000.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.4 INFORMATION SYSTEMS APPLICATIONS

General Terms:
Performance, Theory

Keywords:
cryptography, data-hiding, exhaustive search, information theory, random binning, reversibility, security leakage analysis