Statistical analysis of watermarking schemes for copyright protection of images

Hernández, Juan Ramón Hernández; Pérez-González, Fernando

doi:10.1109/5.771069

Cited by 144 publications

(91 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Therefore, the computation of C ∆i at the beginning of the detection protocol described in Section 3.4 has to be extended by an additional multiplication subproof and a proof that Ŵ [m] i −1 was computed correctly. 4 Clearly, the entire detection protocol can be extended by the described subproofs, but this introduces additional overhead. Hence, embedding the watermark with Equation (1) yields a more efficient zero-knowledge watermark detection protocol.…”

Section: Equation 2: In This Case ∆ I Is Obtained As the Quotientmentioning

confidence: 99%

“…This also includes more advanced embedding and detection strategies to improve robustness and imperceptibility with respect to the HVS as cited in [4]. We have chosen the scheme of Cox et al [3], because it is a widely known example of correlation-based watermark detection and convenient to demonstrate the practical feasibility of strong zero-knowledge watermark detection.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Adelsbach

Sadeghi

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. Cryptographic techniques have been deployed to securely prove the presence of a watermark in stego-data without disclosing any security critical information to the detecting party.This paper presents a detailed practical construction and implementation results of a correlation-based non-blind watermarking scheme in the non-interactive zero-knowledge setting. We extensively describe the modifications and hurdles that had to be overcome to transform a wellknown watermarking scheme -whose general detection principle is applied in many other known schemes -into a two-party setting where the critical detection input, i.e. the watermark vector and the original data is cryptographically concealed from the verifying party using a commitment scheme. Our prototype implementation is very efficient and is an evidence of the practical feasibility of zero-knowledge watermark detection.

show abstract

Section: Equation 2: In This Case ∆ I Is Obtained As the Quotientmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Adelsbach

Sadeghi

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…To succeed, an attacker has to devise some forged content (arbitrarily distinct from the watermarked one) keeping the watermark detectable. These requirements, which are exactly opposed to the robust watermarking ones, refer to the fragile watermarking problems class 1 . Nevertheless, fragile watermarking has been seldom addressed in a gametheoretic point of view [4].…”

Section: Introductionmentioning

confidence: 99%

“…one-bit watermarking) addresses the problem to determine whether a tested content contains a given watermark (hypothesis H1) or not (hypothesis H0). Regardless to the embedding techniques and detection strategies, this problem has been initially introduced to address copyright protection issues [1]. In this context, the presence of a signature conveys commercial rights information about the tested content.…”

Section: Introductionmentioning

confidence: 99%

Spread-Spectrum Substitution watermarking Game

Boyer¹,

Duhamel²,

Blanc-Talon

2006

2006 IEEE International Conference on Multimedia and Expo

View full text Add to dashboard Cite

In the integrity checking context of multimedia contents, a malicious user aims at devising a forged content in order to fool a watermarker by making him use as a genuine content. By considering that the watermark acts as an integrity stamp, the false-alarm probability to recover the watermark signature in a forged content is the criterion of interest. We study and solve a game for this criterion between a watermarker and a falsifier which is allowed to perform a substitution attack, i.e. replace the watermarked signal by a non-watermarked content. As for the watermarker, we are concerned with additive spread-spectrum (SS) embedding. Signals are modeled by parallel colored gaussian processes. Due to the intractability of the false-alarm probability, we resort to Chernoff bound as an alternative cost. Our study confirms some common heuristics: the best attacker choice is to substitute the watermarked host signal using a signal which has very close statistics to the original host signal. The best watermarker strategy is to embed the watermark into the weakest frequency power components of the host signal. We finally consider the consequences of these results in terms of frequency embedding domain for an image SS watermarking scheme which has to be robust to compression. This reveals notable differences with informed scalar quantized-based schemes.

show abstract

“…Recently, more theoretical approaches have attempted to provide watermarking, and the larger field of information hiding, with a stronger foundation [44,16,27,47,10,33,51,31,34,8,48]. Of particular note, Moulin and O'Sullivan [34] have introduced a powerful information-theoretic framework for studying watermarking.…”

Section: Introductionmentioning

confidence: 99%

Analysis of digital watermarks subjected to optimum linear filtering and additive noise

Eggers

Girod

2001

Signal Processing

View full text Add to dashboard Cite

Using a theoretical approach based on random processes, signal processing, and information theory, we study the performance of digital watermarks subjected to an attack consisting of linear shift-invariant filtering and additive colored Gaussian noise. Watermarking is viewed as communication over a hostile channel, where the attack takes place. The attacker attempts to minimize the channel capacity under a constraint on the attack distortion (distortion of the attacked signal), and the owner attempts to maximize the capacity under a constraint on the embedding distortion (distortion of the watermarked signal). The distortion measure is frequency-weighted mean-squared error (MSE). In a conventional additive-noise channel, communication is most difficult when the noise is white and Gaussian, so we first investigate an effective white-noise attack based on this principle. We then consider the problem of resisting this attack and show that capacity is maximized when a power-spectrum condition (PSC) is fulfilled. The PSC states that the power spectrum of the watermark should be directly proportional to that of the original signal. However, unlike a conventional channel, the hostile attack channel adapts to the watermark, not vice versa. Hence, the effective white-noise attack is suboptimal. We derive the optimum attack, which minimizes the channel capacity for a given attack distortion. The attack can be roughly characterized by a rule-of-thumb: At low attack distortions, it adds noise, and at high attack distortions, it discards frequency components. Against the optimum attack, the PSC does not maximize capacity at all attack distortions. Also, there is no unique watermark power spectrum that maximizes capacity over the entire range of attack distortions. To find the watermark power spectrum that maximizes capacity against the optimum attack, we apply iterative numerical methods, which alternately adjust the watermark power spectrum and re-optimize the parameters of the optimum attack. Experiments using ordinary MSE distortion lead to a rule-of-thumb: White watermarks perform nearly optimally at low attack distortions, while PSC-compliant watermarks perform nearly optimally at high attack distortions. The effect of interference from the original signal in suboptimal blind watermarking schemes is also considered; experiments examine its influence on the optimized watermark power spectra and the potential increase in capacity when it can be partially suppressed. Additional experiments demonstrate the importance of memory, and compare the optimum attack with suboptimal attack models. Finally, the rule-of-thumb for the defense is extended to the case of frequency-weighted MSE as a distortion measure.

show abstract

Statistical analysis of watermarking schemes for copyright protection of images

Cited by 144 publications

References 43 publications

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Spread-Spectrum Substitution watermarking Game

Analysis of digital watermarks subjected to optimum linear filtering and additive noise

Contact Info

Product

Resources

About