Watermarking Attack: Security of WSS Techniques

Cayre, François; Fontaine, Caroline; Furon, Teddy

doi:10.1007/978-3-540-31805-7_15

Cited by 12 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…7 for CW. Since Circular Watermarking renders carrier modulation jointly circular, we obtain dependency among message modulations, thus even powerful practical BSS attacks [36] are hopeless when using CW. There are no independent directions to allow for reliable carrier estimation using ICA.…”

Section: Cw Featuresmentioning

confidence: 99%

Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding

Cayre¹,

Bas²

2008

IEEE Trans.Inform.Forensic Secur.

100

View full text Add to dashboard Cite

Abstract-It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensuring datahiding security. Using proper and realistic a priori hypothesis on the messages distribution, it is possible to accurately estimate the secret carriers by casting this estimation problem into a Blind Source Separation problem. After reviewing relevant works on spread-spectrum security for watermarking, we further develop on this topic to introduce the concept of security classes which broaden previous notions in watermarking security and fills the gap with steganography security as defined by Cachin. We define four security classes, namely, by order of creasing security: insecurity, key-security, subspace-security and stego-security. To illustrate these views, we present two new modulations for truly secure watermarking in the Watermark-Only-Attack (WOA) framework. The first one is called Natural Watermarking and can be made either stego-secure or subspace-secure. The second is called Circular Watermarking and is key-secure. We show that Circular Watermarking has robustness comparable to that of the insecure classical spread spectrum. We shall also propose information leakage measures to highlight the security level of our new spread-spectrum modulations.Index Terms-Spread spectrum watermarking, security.

show abstract

Section: Cw Featuresmentioning

confidence: 99%

Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding

Cayre¹,

Bas²

2008

IEEE Trans.Inform.Forensic Secur.

100

View full text Add to dashboard Cite

show abstract

“…He has estimated the secret carriers by a WOA, with N o ∼ 1000 images such that η = 0.5 5 , and he tries to remove the hidden information for one carrier. Details of algorithm adaptations to real images may be found in [33]. by the number of observations the opponent needs in order to accurately estimate the secret key.…”

Section: E Application To a Robust Watermarking Techniquementioning

confidence: 99%

Watermarking security: theory and practice

Cayre

Fontaine

Furon

2005

IEEE Trans. Signal Process.

253

166

View full text Add to dashboard Cite

This article proposes a theory of watermarking security based on a cryptanalysis point of view. The main idea is that information about the secret key leaks from the observations, for instance watermarked pieces of content, available to the opponent. Tools from information theory (Shannon's mutual information and Fisher's information matrix) can measure this leakage of information. The security level is then defined as the number of observations the attacker needs to successfully estimate the secret key. This theory is applied to two common watermarking methods: the substitutive scheme and the spread spectrum based techniques. Their security levels are calculated against three kinds of attack. The experimental work illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels derived in the theoretical part of the article.

show abstract

“…Also authors of [5] use the ambiguity attack to design a new zero-knowledge watermarking scheme. Recently Cayre et al [6] successfully mounted an attack on "wide spread spectrum(WSS)" based watermarking techniques, in which authors propose a key recovery attack using Blind Source Separation tools like Principal Component Analysis and Independent Component Analysis. Here, we introduce an attack which employs completely different methodology from those attacks and it is analogous to cryptographic key recovery attack.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, collusion attack may not be practical as it requires a large number of watermarked copies to be successful. Thus attacks based on single watermarked copy are gaining lot of attention [12,10,15,6]. According to [12], there are lots of redundant clips in an audio/video.…”

Section: Introductionmentioning

confidence: 99%

“…Further, these schemes should withstand several benchmark attacks available in the existing literature. However, "Benchmarking is not really a security evaluation, but mainly a robustness evaluation" [6]. In the absence of proper security evaluation, these schemes depend on the sophisticated signal processing techniques to earn user confidence and acceptability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cryptanalysis of Barni et al. Watermarking Scheme

Das

Zhou

2005

Progress in Cryptology - INDOCRYPT 2005

View full text Add to dashboard Cite

Abstract.In this paper, we analyze a wavelet based watermarking scheme proposed by Barni et al in 2001. The said scheme modifies high frequency wavelet coefficients to embed a watermark in an image. The scheme employs well known HVS model during embedding to embed the watermark in a perceptually transparent manner. Here we present a successful cryptanalysis of the scheme using single watermarked copy. In the process of cryptanalysis, we recover the watermark signal from the marked image and the attack is similar to cryptographic key recovery attack. Furthermore, we not only successfully recover the secret watermark signal from the attacked image, but also we are able to remove the watermark. This raises a serious question about the security and usability of the watermarking scheme in any practical system.

show abstract

Watermarking Attack: Security of WSS Techniques

Cited by 12 publications

References 18 publications

Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding

Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding

Watermarking security: theory and practice

Cryptanalysis of Barni et al. Watermarking Scheme

Contact Info

Product

Resources

About