#### DMCA

## Practical Data-Hiding: Additive Attacks Performance Analysis (2005)

Venue: | In International Workshop on Digital Watermarking, volume LNCS 3710 of Lecture Notes in Computer Science |

Citations: | 1 - 1 self |

### Citations

1024 |
Writing on Dirty Paper
- Costa
- 1983
(Show Context)
Citation Context ... W; � � d(y,v)fY,V(y,v) ≤ σ 2 Z, (1) x∈X N y∈YN y∈YN v∈VN where d(x,y) = 1 �N N i=1 d(xi,yi). Costa considered the Gel’fand-Pinsker problem for the i.i.d. Gaussian case and mean square error distance =-=[5]-=-. The embedder ϕ produces Y = W + X, X ∼ N(0,σ 2 XIN) and the channel output is obtained as: V = X+W+Z, where Z ∼ N(0,σ 2 ZIN). The estimate of the message ˆm is obtained at the decoder as in the Gel’... |

490 | Quantization index modulation: A class of provably good methods for digital watermarking and information embedding
- Chen, Wornell
- 2001
(Show Context)
Citation Context ...not indeed be the WCAA because of its infinite support. Vila-Forcén et al. [19] and Goteti and Moulin [9] solved independently the min-max problem for distortion-compensated dither modulation (DC-DM) =-=[3]-=- in terms of probability of error for the fixed decoder, binary signaling, the subclass of additive attacks in data-hiding and detection-formulation, respectively. The additional difference between th... |

320 |
Coding for Channels with Random Parameters
- Gel’fand, Pinsker
- 1980
(Show Context)
Citation Context ...ed attention in the watermarking community. They are a practical implementation of a binning technique for channels whose state is non-causally available at the encoder considered by Gel’fand-Pinsker =-=[8]-=-. Recently it has been also demonstrated [13] that quantization-based data-hiding performance coincides with the spread-spectrum (SS) data-hiding at the low-WNR by taking into account the host statist... |

261 | Information-Theoretic Analysis of Information Hiding
- Moulin, O'Sullivan
- 2003
(Show Context)
Citation Context ...ion codes. In general, the digital data-hiding can be considered as a game between the data-hider and the attacker. This three-party two-players game was already investigated by Moulin and O’Sullivan =-=[12]-=- where two set-ups are analyzed. In the first one, the host is assumed to be available at both encoder and decoder prior to the transmission, the so-called private game. In the second one, the host is... |

117 | Scalar costa scheme for information embedding
- Eggers, Bauml, et al.
- 2003
(Show Context)
Citation Context ...fixes the encoder structure for the quantization-based methods. Although the optimal α ′ can easily be determined when the power of the noise is available at 3s4 the encoder prior to the transmission =-=[6]-=-, this is not always feasible for various practical scenarios. Nevertheless, the availability of the attacking power and of the attacking pdf is a very common assumption in most data-hiding schemes. W... |

63 | Performance analysis of existing and new methods for data hiding with known-host information in additive channels
- Pérez-González, Balado, et al.
- 2003
(Show Context)
Citation Context ...n noise (AWGN) is not the WCAA for discrete input alphabets such as pulse amplitude modulation in digital communications [10]. Similar conclusion for data-hiding was obtained by Pérez-González et al. =-=[14]-=-, who demonstrated that the uniform noise attack performs worse than the AWGN attack for some watermark-to-noise ratios (WNRs). In [15], PérezGonzález demonstrated that the AWGN cannot indeed be the W... |

51 | Attacks on digital watermarks: Classification, estimation based attacks, and benchmarks
- Voloshynovskiy, Pereira, et al.
- 2001
(Show Context)
Citation Context ...he group of WCAA conforms to the signal processing attacks and directly exploits the knowledge of the watermark statistics caused by the structured codebook design. We refer the interested readers to =-=[23, 24]-=- for more information about attacks classification. More recent studies [4, 17, 22] address the impact of security leakages in the scope of information-theoretic analysis for geometrically structured ... |

37 |
On the error exponent and capacity games of private watermarking systems
- Somekh-Baruch, Merhav
- 2003
(Show Context)
Citation Context .... Somekh-Baruch and Merhav considered the data-hiding problem in terms of maximum achievable rates and error exponents. They assumed that the host data is available either at both encoder and decoder =-=[1]-=- or only at the encoder [16] and supposed that neither encoder nor decoder is aware of the attacker strategy. In their consideration, the class of potentially applied attacks is significantly broader ... |

35 | QIM watermarking games
- Goteti, Moulin
(Show Context)
Citation Context ...k for some watermark-to-noise ratios (WNRs). In [15], PérezGonzález demonstrated that the AWGN cannot indeed be the WCAA because of its infinite support. Vila-Forcén et al. [19] and Goteti and Moulin =-=[9]-=- solved independently the min-max problem for distortion-compensated dither modulation (DC-DM) [3] in terms of probability of error for the fixed decoder, binary signaling, the subclass of additive at... |

29 | On the capacity game of public watermarking systems
- Somekh-Baruch, Merhav
- 2004
(Show Context)
Citation Context ...considered the data-hiding problem in terms of maximum achievable rates and error exponents. They assumed that the host data is available either at both encoder and decoder [1] or only at the encoder =-=[16]-=- and supposed that neither encoder nor decoder is aware of the attacker strategy. In their consideration, the class of potentially applied attacks is significantly broader than in the previous study c... |

28 |
A.: The zero-rate spread-spectrum watermarking game
- Moulin, Ivanovic
- 2003
(Show Context)
Citation Context ...imum likelihood (ML) decoding is applied. A similar game-theoretic analysis of the |M|-ary information detection problem, the so-called zero-rate spread spectrum watermarking problem, is performed in =-=[11]-=-. As in the previous case, it is assumed that the detector has the possibility to learn the statistics of the attacking channel. In both cases [11, 12], the results were obtained under the assumption ... |

26 |
Watermarking Systems Engineering
- Barni, Bartolini
- 2004
(Show Context)
Citation Context ...stance (MD) decoder is implemented as a low-complexity equivalent of the ML decoder under the assumption of a channel pdf created by the symmetric extension of a monotonically non-increasing function =-=[2]-=-. It is a common practice in the data-hiding community to measure the performance in terms of the error rate for a given decoding rule as well as the maximum achievable rate of reliable communications... |

16 | Revealing the true achievable rates of Scalar Costa Scheme
- Pérez-Freire, Pérez-González, et al.
- 2004
(Show Context)
Citation Context ...tion-based methods the mutual information is measured between the communicated message M and the channel output V [15] and the above problem is given by: maxφ min fV |Y (·|·) I φ,fV |Y (·|·)(M;V ′ ). =-=(13)-=- where V ′ = Q∆(V ) − V , since it was shown in [15] that modulo operation does not reduce the mutual information between V and M if the host is assumed to be flat within the quantization bins. Rewrit... |

13 | Worst case additive attack against quantization-based data-hiding methods
- Vila-Forcén, Voloshynovskiy, et al.
(Show Context)
Citation Context ...s worse than the AWGN attack for some watermark-to-noise ratios (WNRs). In [15], PérezGonzález demonstrated that the AWGN cannot indeed be the WCAA because of its infinite support. Vila-Forcén et al. =-=[19]-=- and Goteti and Moulin [9] solved independently the min-max problem for distortion-compensated dither modulation (DC-DM) [3] in terms of probability of error for the fixed decoder, binary signaling, t... |

10 | Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence
- McKellips, Verdu
- 1997
(Show Context)
Citation Context ...wer-limited attacks. McKellips and Verdu showed that the additive white Gaussian noise (AWGN) is not the WCAA for discrete input alphabets such as pulse amplitude modulation in digital communications =-=[10]-=-. Similar conclusion for data-hiding was obtained by Pérez-González et al. [14], who demonstrated that the uniform noise attack performs worse than the AWGN attack for some watermark-to-noise ratios (... |

8 | An informationtheoretic framework for assessing security in practical watermarking and data hiding scenarios
- Comesaña-Alfaro, Pérez-Freire, et al.
(Show Context)
Citation Context ... the knowledge of the watermark statistics caused by the structured codebook design. We refer the interested readers to [23, 24] for more information about attacks classification. More recent studies =-=[4, 17, 22]-=- address the impact of security leakages in the scope of information-theoretic analysis for geometrically structured and quantizationbased codebooks and general reversibility of watermark embedding. T... |

8 |
Attack modelling: Towards a second generation benchmark
- Voloshynovskiy, Pereira, et al.
- 2001
(Show Context)
Citation Context ...he group of WCAA conforms to the signal processing attacks and directly exploits the knowledge of the watermark statistics caused by the structured codebook design. We refer the interested readers to =-=[23, 24]-=- for more information about attacks classification. More recent studies [4, 17, 22] address the impact of security leakages in the scope of information-theoretic analysis for geometrically structured ... |

7 | On reversibility of random binning techniques: multimedia perspectives
- Voloshynovskiy, Koval, et al.
- 2005
(Show Context)
Citation Context ... the knowledge of the watermark statistics caused by the structured codebook design. We refer the interested readers to [23, 24] for more information about attacks classification. More recent studies =-=[4, 17, 22]-=- address the impact of security leakages in the scope of information-theoretic analysis for geometrically structured and quantizationbased codebooks and general reversibility of watermark embedding. T... |

5 |
Additive NonGaussian Attacks on the Scalar Costa Scheme (SCS
- Tzschoppe, Bäuml, et al.
(Show Context)
Citation Context ...gies, in the latter one the Bhatacharyya bound is exploited in order to reduce the complexity of the considered game optimization problem. Simultaneously, Vila-Forcén et al. [20] and Tzschoppe et al. =-=[18]-=- derived the WCAA for DC-DM using the mutual information as objective function for additive attacks and binary signaling. The goal of this paper is to provide an overview of the WCAA against quantizat... |

5 | Information-theoretic data-hiding: Recent achievements and open problems
- Voloshynovskiy, Deguillaume, et al.
(Show Context)
Citation Context ...stortion constraints. Their resistance against different attacks determine the possible application scenarios. An extensive review of various application of digital data-hiding techniques is given in =-=[21]-=-. The knowledge of the WCA allows to create a fair benchmark for data-hiding techniques and makes it possible to provide reliable communications with the use of appropriate error correction codes. In ... |

4 |
Lattice decoding can achieve 0.5 log(1+snr) over the additive white gaussian noise channel using nested codes
- Erez, Zamir
- 2001
(Show Context)
Citation Context ... of random ones. The most famous discrete approximations of Costa problem are known as DC-DM [3] and scalar Costa scheme (SCS) [6]. The structured codebooks are designed using quantizers (or lattices =-=[7]-=-) in order to achieve host interference cancellation. In the case of DC-DM, the stego data is obtained as follows: φDC-DM(m,x,α ′ ) = y = x + α ′ (Qm(x) − x), (2) where Qm(·) denotes a vector or scala... |

4 |
The importance of aliasing in structured quantization modulation data hiding
- Pérez-González
- 2003
(Show Context)
Citation Context ...conclusion for data-hiding was obtained by Pérez-González et al. [14], who demonstrated that the uniform noise attack performs worse than the AWGN attack for some watermark-to-noise ratios (WNRs). In =-=[15]-=-, PérezGonzález demonstrated that the AWGN cannot indeed be the WCAA because of its infinite support. Vila-Forcén et al. [19] and Goteti and Moulin [9] solved independently the min-max problem for dis... |

3 | Towards geometrically robust data-hiding with structured codebooks
- Topak, Voloshynovskiy, et al.
- 2005
(Show Context)
Citation Context ... the knowledge of the watermark statistics caused by the structured codebook design. We refer the interested readers to [23, 24] for more information about attacks classification. More recent studies =-=[4, 17, 22]-=- address the impact of security leakages in the scope of information-theoretic analysis for geometrically structured and quantizationbased codebooks and general reversibility of watermark embedding. T... |