Trellis coded modulation to improve dirty paper trellis watermarking

Wang, Chin Kiong; Doerr, Gwenaël; Cox, Ingemar J.

doi:10.1117/12.704379

Cited by 10 publications

(4 citation statements)

References 24 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method implicitly assumes that a different pattern is attached to each arc in the trellis. Therefore, it will fail to deal with the recent improvements proposed for DPT watermarking based on trellis coded modulation [14].…”

Section: Connections and State Estimationmentioning

confidence: 99%

Practical Security Analysis of Dirty Paper Trellis Watermarking

Bas

Doerr

2007

Information Hiding

Self Cite

View full text Add to dashboard Cite

This paper analyses the security of dirty paper trellis (DPT) watermarking schemes which use both informed coding and informed embedding. After recalling the principles of message embedding with DPT watermarking, the secret parameters of the scheme are highlighted. The security weaknesses of DPT watermarking are then presented: in the watermarked contents only attack (WOA) setup, the watermarked data-set exhibits clusters corresponding to the different patterns attached to the arcs of the trellis. The K-means clustering algorithm is used to estimate these patterns and a co-occurrence analysis is performed to retrieve the connectivity of the trellis. Experimental results demonstrate that it is possible to accurately estimate the trellis configuration, which enables to perform attacks much more efficient than simple additive white Gaussian noise (AWGN).

show abstract

Section: Connections and State Estimationmentioning

confidence: 99%

Practical Security Analysis of Dirty Paper Trellis Watermarking

Bas

Doerr

2007

Information Hiding

Self Cite

View full text Add to dashboard Cite

show abstract

“…In digital watermarking, the same problem is extended by an attack channel between the sender and the receiver, which calls for a combination of good source and channel codes. This combination can be implemented using nested convolutional (trellis) codes and is better known as Dirty-paper codes [46]. Different practical application of the binning concept is in the distributed source coding problem [43].…”

Section: G Stcs In Context Of Other Workmentioning

confidence: 99%

Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes

Filler

Judas

Fridrich

2011

IEEE Trans.Inform.Forensic Secur.

766

440

View full text Add to dashboard Cite

Abstract-This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (non-binary) embedding operation. Let every possible value of every stego element be assigned a scalar expressing the distortion of an embedding change done by replacing the cover element by this value. The total distortion is assumed to be a sum of per-element distortions. Both the payload-limited sender (minimizing the total distortion while embedding a fixed payload) and the distortion-limited sender (maximizing the payload while introducing a fixed total distortion) are considered. Without any loss of performance, the non-binary case is decomposed into several binary cases by replacing individual bits in cover elements. The binary case is approached using a novel syndromecoding scheme based on dual convolutional codes equipped with the Viterbi algorithm. This fast and very versatile solution achieves state-of-the-art results in steganographic applications while having linear time and space complexity w.r.t. the number of cover elements. We report extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel. Practical merit of this approach is validated by constructing and testing adaptive embedding schemes for digital images in raster and transform domains. Most current coding schemes used in steganography (matrix embedding, wet paper codes, etc.) and many new ones can be implemented using this framework.

show abstract

“…The trellis structure and the codeword construction should also be clarified as exposed in. 16 Security of our approach should also be evaluated as it has been done for the original DPTC in 5 and for the Broken Arrows algorithm in. 10…”

Section: Resultsmentioning

confidence: 99%

A novel embedding technique for dirty paper trellis codes watermarking

Chaumont

2010

SPIE Proceedings

View full text Add to dashboard Cite

Dirty Paper Trellis Codes (DPTC) watermarking, published in 2004, is a very efficient high rate scheme. Nevertheless, it has two strong drawbacks: its security weakness and its CPU computation complexity. We propose an embedding space at least as secure and a faster embedding. The embedding space is built on the projections of some wavelet coefficients onto secret carriers. It keeps a good security level and has also good psycho-visual properties. The embedding is based on a dichotomous rotation in the Cox, Miller and Boom Plane. It gives better performances than previous fast embedding approaches. Four different attacks are performed and revealed good robustness and rapidity performances.

show abstract

Trellis coded modulation to improve dirty paper trellis watermarking

Cited by 10 publications

References 24 publications

Practical Security Analysis of Dirty Paper Trellis Watermarking

Practical Security Analysis of Dirty Paper Trellis Watermarking

Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes

A novel embedding technique for dirty paper trellis codes watermarking

Contact Info

Product

Resources

About