Results 1 - 10
of
61
Detection in Quantization-Based Watermarking: Performance and Security Issues
- OF PROC. OF SPIE-IS&T ELECTRONIC IMAGING
, 2005
"... In this paper, a novel method for detection in quantization-based watermarking is introduced. This method basically works by quantizing a projection of the host signal onto a subspace of smaller dimensionality. A theoretical performance analysis under AWGN and fixed gain attacks is carried out, show ..."
Abstract
-
Cited by 18 (4 self)
- Add to MetaCart
In this paper, a novel method for detection in quantization-based watermarking is introduced. This method basically works by quantizing a projection of the host signal onto a subspace of smaller dimensionality. A theoretical performance analysis under AWGN and fixed gain attacks is carried out, showing great improvements over traditional spread-spectrum-based methods operating under the same conditions of embedding distortion and attacking noise. A security analysis for oracle-like attacks is also accomplished, proposing a sensitivity attack suited to quantization-based methods for the first time in the literature, and showing a trade-off between security level and performance; anyway, this new method o#ers significant improvements in security, once again, over spread-spectrum-based methods facing the same kind of attacks.
Spread Spectrum Watermarking Security
- IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
, 2008
"... This paper presents both theoretical and practical analyses of the security offered by watermarking and data hiding methods based on spread spectrum. In this context, security is understood as the difficulty of estimating the secret parameters of the embedding function based on the observation of wa ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
This paper presents both theoretical and practical analyses of the security offered by watermarking and data hiding methods based on spread spectrum. In this context, security is understood as the difficulty of estimating the secret parameters of the embedding function based on the observation of watermarked signals. On the theoretical side, the security is quantified from an information-theoretic point of view by means of the equivocation about the secret parameters. The main results reveal fundamental limits and bounds on security and provide insight into other properties, such as the impact of the embedding parameters, and the tradeoff between robustness and security. On the practical side, workable estimators of the secret parameters are proposed and theoretically analyzed for a variety of scenarios, providing a comparison with previous approaches, and showing that the security of many schemes used in practice can be fairly low.
Worst Case Additive Attack against Quantization-Based Data-Hiding Methods
, 2005
"... The main goal of this study consists in the development of the worst case additive attack (WCAA) for quantization-based methods using as design criteria the bit error rate probability and the maximum achievable rate of reliable communications. Our analysis is focused on the practical scheme known as ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
The main goal of this study consists in the development of the worst case additive attack (WCAA) for quantization-based methods using as design criteria the bit error rate probability and the maximum achievable rate of reliable communications. Our analysis is focused on the practical scheme known as a distortion compensation dither modulation (DC-DM). From the mathematical point of view, the problem of the worst case attack (WCA) design using probability of error as a cost function can be formulated as the maximization of the average probability of error subject to the introduced distortion for a given decoding rule. When mutual information is selected as a cost function, a solution of the minimization problem should provide such an attacking noise probability density function (pdf) that will maximally decrease the rate of reliable communications for an arbitrary decoder structure. The results show that within the class of additive noise attacks the developed attack leads to a stronger performance decrease for the considered class of embedding techniques than the AWGN or the uniform noise attacks.
Informed watermarking by means of orthogonal and quasi-orthogonal dirty paper coding
- IEEE Trans. Signal Process
, 2005
"... Abstract—A new dirty paper coding technique that is robust against the gain attack is presented. Such a robustness is obtained by adopting a set of (orthogonal) equi-energetic codewords and a correlation-based decoder. Due to the simple structure of or-thogonal codes, we developed a simple yet power ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
(Show Context)
Abstract—A new dirty paper coding technique that is robust against the gain attack is presented. Such a robustness is obtained by adopting a set of (orthogonal) equi-energetic codewords and a correlation-based decoder. Due to the simple structure of or-thogonal codes, we developed a simple yet powerful technique to embed the hidden message within the host signal. The proposed technique is an optimal one, in that the embedding distortion is minimized for a given robustness level, where robustness is measured through the maximum pairwise error probability in the presence of an additive Gaussian attack of given strength. The performance of the dirty coding algorithm is further improved by replacing orthogonal with quasi- orthogonal codes, namely, Gold sequences, and by concatenating them with an outer turbo code. To this aim, the inner decoder is modified to produce a soft estimate of the embedded message. Performance analysis is carried out by means of extensive simulations proving the validity of the novel watermarking scheme. Index Terms—Dirty paper coding, informed embedding, in-formed watermarking, orthogonal codes, spherical codes, turbo coding. I.
Performance analysis of ST-DM watermarking in presence of nonadditive attacks
- IEEE Transactions on Signal Processing
"... Abstract—The performance of spread-transform dither modu-lation (ST-DM) watermarking in the presence of two important classes of non additive attacks, such as the gain attack plus noise addition, and the quantization attack are evaluated. The analysis is developed under the assumption that the host ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
Abstract—The performance of spread-transform dither modu-lation (ST-DM) watermarking in the presence of two important classes of non additive attacks, such as the gain attack plus noise addition, and the quantization attack are evaluated. The analysis is developed under the assumption that the host features are in-dependent and identically distributed Gaussian random variables, and that a minimum distance criterion is used to decode the hidden information. The theoretical bit-error probabilities are derived in closed form, thus permitting to evaluate the impact of the consid-ered attacks on the watermark at a theoretical level. The analysis is validated by means of extensive Monte Carlo simulations. In ad-dition to the validation of the theoretical analysis, Monte Carlo simulations permitted to abandon the hypothesis of normally dis-tributed host features, in favor of more realistic models adopting a Laplacian or a generalized Gaussian probability density function. The general result of our analysis is that the excellent performance of ST-DM are confirmed in all cases with the only noticeable ex-ception of the gain attack. Index Terms—Gain attack, nonadditive watermarking channel, quantization attack, ST-DM watermarking. I.
Rational dither modulation: a novel data-hiding method robust to value-metric attacks
- In In IEEE International Workshop on Multimedia Signal Processing
, 2004
"... Abstract — A novel quantization-based data-hiding method, named Rational Dither Modulation (RDM), is presented. This method amounts to simple modifications of the well-known Dither Modulation (DM) scheme, which is largely vulnerable to scaling attacks. With such modifications, RDM becomes invariant ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Abstract — A novel quantization-based data-hiding method, named Rational Dither Modulation (RDM), is presented. This method amounts to simple modifications of the well-known Dither Modulation (DM) scheme, which is largely vulnerable to scaling attacks. With such modifications, RDM becomes invariant to those attacks. Since RDM does not work by trying to estimate the step-size of the quantizers, it does not need any pilot-sequence. Moreover, RDM is suitable for a scalar operation, thus avoiding the cumbersome constructions of spherical codes. It is also shown that RDM approaches the performance of DM asymptotically with the size of the memory needed for the method to operate. Simulation results show the accuracy of our theoretical analysis and the superiority of RDM compared to the Improved Spread Spectrum method. I.
Nothing But a Kiss: A Novel and Accurate Approach to Assessing The Performance of Multidimensional Distortion-Compensated Dither Modulation
- in Proc. of the 5th International Workshop on Information Hiding, Lecture Notes in Computer Science, (Noorwijkerhout, The
, 2002
"... A considerable amount of attention has been lately paid to a number of data hiding methods based on quantization, seeking to achieve in practice the results predicted by Costa for a channel with side information at the encoder. In this paper we analyze a multidimensional extension of the implemen ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
A considerable amount of attention has been lately paid to a number of data hiding methods based on quantization, seeking to achieve in practice the results predicted by Costa for a channel with side information at the encoder. In this paper we analyze a multidimensional extension of the implementation of Costa's result known as DC-QIM. The presented analysis is based on measuring the probabilities of decoding error in the presence of two important kinds of additive channel distortions. DC-QIM is able to achieve a probability of decoding error of less than 1e-02 for 0 dB of watermark to noise ratio and only 20 samples per hidden bit. Empirical results supporting our analysis are given both for synthetic data and real images.
Improved watermark detection for spread-spectrum based watermarking using independent component analysis
- Proceedings of 2005 ACM Workshop on Digital Rights Management
, 2005
"... This paper presents an efficient blind watermark detection/decoding scheme for spread spectrum (SS) based watermarking, exploiting the fact that in SS-based embedding schemes the embedded watermark and the host signal are mutually independent and obey non-Gaussian distribution. The proposed scheme e ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
(Show Context)
This paper presents an efficient blind watermark detection/decoding scheme for spread spectrum (SS) based watermarking, exploiting the fact that in SS-based embedding schemes the embedded watermark and the host signal are mutually independent and obey non-Gaussian distribution. The proposed scheme employs the theory of independent component analysis (ICA) and posed the watermark detection as a blind source separation problem. The proposed ICA-based blind detection/decoding scheme has been simulated using real-world audio clips. The simulation results show that the ICA-based detector can detect and decode watermark with extremely low decoding bit error probability (less than 0.01) against common watermarking attacks and benchmark degradations.
Spread-spectrum vs. quantization-based data hiding: Misconceptions and implications
- in Proceedings of IS&T/SPIE 17th Annual Symposium: Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents VII
, 2005
"... The performance of quantization-based data hiding methods is commonly analyzed by assuming a flat probability density function for the host signal, i.e. uniform inside each quantization cell and with its variance large enough to assuming that all the centroids occur with equal probability. This pape ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
The performance of quantization-based data hiding methods is commonly analyzed by assuming a flat probability density function for the host signal, i.e. uniform inside each quantization cell and with its variance large enough to assuming that all the centroids occur with equal probability. This paper comes to fill a gap in watermarking theory, analyzing the exact performance of the Scalar Costa Scheme (SCS) facing additive Gaussian attacks when the former approximation is not valid, thus taking into account the host statistics. The accomplished analysis reveals that the true performance of such a scheme for an optimal selection of its parameters and low watermark to noise ratios (WNR) is never worse than that of classical spread-spectrum-based methods, in terms of achievable rate and probability of error, as it was thought so far. The reduction of SCS to a two-centroid problem allows the derivation of theoretical expressions which characterize its behavior for small WNR’s, showing interesting connections with spread-spectrum (SS) and the Improved Spread Spectrum (ISS) method. Furthermore, we show that, in contrast to the results reported until now, the use of pseudorandom dithering in SCS-based schemes can have a negative impact in performance. Performance losses are also reported for the case in which a modulo reduction is undertaken prior to decoding. The usefulness of these results is shown in the computation of the exact performance in projected domains. Keywords: Scalar Costa Scheme, Spread-Spectrum, achievable rates, BER, performance analysis. 1.
Information-theoretic data-hiding: Recent achievements and open problems
- International Journal of Image and Graphics
"... In this paper we introduce and develop a framework for visual data-hiding technologies that aim at resolving emerging problems of modern multimedia networking. First, we introduce the main open issues of public network security, quality of services control and secure communications. Secondly, we for ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
In this paper we introduce and develop a framework for visual data-hiding technologies that aim at resolving emerging problems of modern multimedia networking. First, we introduce the main open issues of public network security, quality of services control and secure communications. Secondly, we formulate digital data-hiding into visual content as communications with side information and advocate an appropriate informationtheoretic framework for the analysis of different data-hiding methods in various applications. In particular, Gel’fand-Pinsker channel coding with side information at the encoder and Wyner-Ziv source coding with side information at the decoder are used for this purpose. Finally, we demonstrate the possible extensions of this theory for watermark-assisted multimedia processing and indicate its perspectives for distributed communications. Keywords: Data-hiding; robust watermarking; copyright protection; tamper proofing; secure communications; steganography; network security; network quality-of-service. 1.
