Fast Embedding Technique for Dirty Paper Trellis Watermarking

  • Marc Chaumont
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5703)


This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute projections onto secrets carriers. When dealing with high rate watermarking, the CPU cost for those projections is dramatically high. After introducing the watermarking scheme, we then propose two Space Division Multiplexing (SDM) approaches which reduce the complexity. Evaluations are achieved with four different attacks and show that our proposal gives better robustness results with SDM approaches.


Watermark Scheme Message Size Host Signal Viterbi Decoder Security Weakness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Miller, M.L., Doërr, G.J., Cox, I.J.: Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark. IEEE Transactions on Image Processing 13(6), 792–807 (2004)CrossRefGoogle Scholar
  2. 2.
    Chaumont, M.: A Novel Embedding Technic for Dirty Paper Trellis Watermarking. In: IEEE International Conference On Image Processing, ICIP 2009, Cairo, Egypt (submitted)(November 2009)Google Scholar
  3. 3.
    Bas, P., Doërr, G.: Evaluation of an Optimal Watermark Tampering Attack Against Dirty Paper Trellis Schemes. In: 10th ACM workshop on Multimedia and Security, MM&Sec 2008, Oxford, United Kingdom, September 2008, pp. 227–232 (2008)Google Scholar
  4. 4.
    Kerckhoffs, A.: La Cryptographie Militaire. Journal des Sciences Militaires IX, 5–38 (January 1883); pp. 161–191 (February 1883)Google Scholar
  5. 5.
    Wang, C., Doërr, G., Cox, I.J.: Toward a Better Understanding of Dirty Paper Trellis Codes. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006, Toulouse, France, May 2006, vol. 2, pp. 233–236 (2006)Google Scholar
  6. 6.
    Lin, L., Cox, I.J., Doërr, G., Miller, M.L.: An Efficient Algorithm for Informed Embedding of Dirty Paper Trellis Codes for Watermarking. In: IEEE International Conference on Image Processing, ICIP 2005, Genova, Italy, September 2005, vol. 1, pp. 697–700 (2005)Google Scholar
  7. 7.
    Cox, I., Miller, M., Bloom, J., Fridrich, J., Kalker, T.: 5. in Multimedia Information and Systems. In: Digital Watermarking and Steganography, 2nd edn., pp. 110–117. Morgan Kaufmann, San Francisco (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Marc Chaumont
    • 1
    • 2
  1. 1.University of NîmesNîmesFrance
  2. 2.Laboratory LIRMM, UMR CNRS 5506University of Montpellier IIMontpellier cedex 05France

Personalised recommendations