IEE Proceedings - Information Security
Volume 153, Issue 3, September 2006
Volume 153, Issue 3
September 2006
-
- Author(s): M. Barni ; G. Doërr ; I.J. Cox
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 75 –76
- DOI: 10.1049/ip-ifs:20069026
- Type: Article
- + Show details - Hide details
-
p.
75
–76
(2)
- Author(s): T. Pevný and J. Fridrich
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 77 –86
- DOI: 10.1049/ip-ifs:20055147
- Type: Article
- + Show details - Hide details
-
p.
77
–86
(10)
The goal of forensic steganalysis is to detect the presence of embedded data and to eventually extract the secret message. A necessary step towards extracting the data is determining the steganographic algorithm used to embed the data. In the paper, we construct blind classifiers capable of detecting steganography in JPEG images and assigning stego images to six popular JPEG embedding algorithms. The classifiers are support vector machines that use 23 calibrated DCT feature calculated from the luminance component. - Author(s): M.T. Hogan ; F. Balado ; G.C.M. Silvestre ; N.J. Hurley
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 87 –95
- DOI: 10.1049/ip-ifs:20055146
- Type: Article
- + Show details - Hide details
-
p.
87
–95
(9)
Two important classes of data hiding methods are the ones established by watermarking and steganographic applications. Whereas in both cases information is concealed inside a host signal subject to an imperceptibility constraint, some of their fundamental requirements differ. Indeed, the design of watermarking schemes is usually guided by the maximum achievable rate with respect to a given attack power, while the most important constraint for steganographic methods is the undetectability of the hidden communication. In this work we examine the tradeoff between achievable rate and undetectability when watermarking and steganographic constraints are simultaneously imposed to a data hiding scheme. In order to illustrate this tradeoff we focus our attention on two relevant methods which are parallel in their structures, and are, respectively, suitable for the two problems at hand. The first one, distortion-compensated dither modulation, is nearly optimal with respect to the watermarking-like requirements. The second one, stochastic quantisation index modulation, automatically meets the undetectability condition under certain assumptions. Conclusions are drawn as to which scheme is preferable for joint watermarking and steganography constraints, given certain channel characteristics. - Author(s): X. Huang and B. Zhang
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 97 –106
- DOI: 10.1049/ip-ifs:20055118
- Type: Article
- + Show details - Hide details
-
p.
97
–106
(10)
Most of the watermark detection schemes proposed until now imply the general assumption that the image coefficients, which may carry watermarks, can be perfectly characterised by certain model distributions. However, there are always (small) deviations of the actual coefficient distributions from the idealised theoretical models owing to inherent modelling errors and possible attacks to the watermarking systems. These uncertain deviations, although usually small, may degrade or even upset the performance of the existing optimum detectors that are optimised under idealised assumptions. In this paper, we present a new detection structure for additive watermarking in transform domains based on Huber's robust hypothesis testing theory. In order to capture the uncertainties, the statistical behaviours of the image subband coefficients are modelled by a contaminated generalised Gaussian distribution (GGD) instead of the perfect GGD. The robust detection structure is derived as a min–max solution of the contamination model and turns out to be a censored version of the optimum probability ratio test. Experimental results on real images confirm the superiority of the proposed detector over the classical optimum detector. - Author(s): A. Abrardo ; M. Barni ; F. Pérez-González ; C. Mosquera
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 107 –114
- DOI: 10.1049/ip-ifs:20055152
- Type: Article
- + Show details - Hide details
-
p.
107
–114
(8)
We propose a method to improve the performance of the recently introduced rational dither modulation (RDM) watermarking scheme. The improvement is obtained by modifying the essentially scalar nature of RDM with the introduction of a vector quantiser. The vector quantiser is based on a properly modified version of classical trellis coded quantisation, thus leading to the new trellis-coded RDM scheme (TC-RDM). Due to the infinite memory of the trellis TC-RDM relies on, the standard Viterbi algorithm is no longer optimum, hence we introduce a new suboptimal encoding algorithm that keeps the computational complexity reasonably low while ensuring a minimal loss with respect to the optimal scheme. The simulations we carried out on synthetic sequences show that TC-RDM permits improvement of the performance of RDM by 2–4 dB in terms of robustness against Gaussian noise addition. - Author(s): P. Comesaña ; L. Pérez-Freire ; F. Pérez-González
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 115 –125
- DOI: 10.1049/ip-ifs:20055151
- Type: Article
- + Show details - Hide details
-
p.
115
–125
(11)
Until now, the sensitivity attack was considered as a serious threat to the robustness and security of spread-spectrum-based schemes, since it provides a practical method of removing watermarks with minimum attacking distortion. Nevertheless, it had not been used to remove the watermark from other watermarking algorithms, such as those which use side-information. Furthermore, the sensitivity attack has never been used to obtain falsely watermarked contents, also known as forgeries. In this paper a new version of the sensitivity attack based on a general formulation is proposed; this method does not require any knowledge about the detection function nor any other system parameter, but just the binary output of the detector, being suitable for attacking most known watermarking methods. The new approach is validated with experiments. - Author(s): P. Bas and J. Hurri
- Source: IEE Proceedings - Information Security, Volume 153, Issue 3, p. 127 –139
- DOI: 10.1049/ip-ifs:20055144
- Type: Article
- + Show details - Hide details
-
p.
127
–139
(13)
Security is one of the crucial requirements of a watermarking scheme, because hidden messages such as copyright information are likely to face hostile attacks. In this paper, we question the security of an important class of watermarking schemes based on dither modulation (DM). DM embedding schemes rely on the quantisation of a secret component according to an embedded message, and the strategies used to improve the security of these schemes are the use of a dither vector and the use of a secret carrier. In this paper we show that contrary to related works that deal with the security of spread spectrum and quantisation schemes, for non-iid host signals such as images, principal component analysis is not an appropriate technique to estimate the secret carrier. We propose the use of a blind source separation technique called independent component analysis (ICA) to estimate and remove the watermark. In the case of DM embedding, the watermark signal corresponds to a quantisation noise independent of the host signal. An attacking methodology using ICA is presented for digital images; this attack consists first in estimating the secret carrier by an examination of the high-order statistics of the independent components and second in removing the embedded message by erasing the component related to the watermark. The ICA-based attack scheme is compared with a classical attack that has been proposed for attacking DM schemes. The results reported in this paper demonstrate how changes in natural image statistics can be used to detect watermarks and devise attacks. Different implementations of DM watermarking schemes such as pixel, DCT and spread transform-DM embedding can be attacked successfully. Our attack provides an accurate estimate of the secret key and an average improvement of 2 dB in comparison with optimal additive attacks. Such natural image statistics-based attacks may pose a serious threat against watermarking schemes which are based on quantisation techniques.
Editorial: Steganography and digital watermarking
Determining the stego algorithm for JPEG images
Secure and robust steganography using side information at the encoder
Robust detection of additive watermarks in transform domains
Improving the performance of RDM watermarking by means of trellis coded quantisation
Blind Newton sensitivity attack
Vulnerability of DM watermarking of non-iid host signals to attacks utilising the statistics of independent components
Most viewed content for this Journal
Article
content/journals/ip-ifs
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
