Locally most-powerful detector for secret key estimation in spread spectrum image steganography

@inproceedings{Trivedi2004LocallyMD,
  title={Locally most-powerful detector for secret key estimation in spread spectrum image steganography},
  author={Shalin P. Trivedi and Rajarathnam Chandramouli},
  booktitle={IS\&T/SPIE Electronic Imaging},
  year={2004}
}
We define sequential steganography as those class of embedding algorithms that hide messages in consecutive (time, spatial or frequency domain) features of a host signal. This paper presents a steganalysis method that estimates the secret key used in sequential steganography. A theory is developed for detecting abrupt jumps in the statistics of the stego signal during steganalysis. Stationary and non-stationary host signals with low, medium and high SNR embedding are considered. A locally most… 
Secret Key Estimation for Image Sequential Steganograph in Transform Domain
TLDR
An improved LMP algorithm is proposed, which not only can reliably estimate the secret key for mid- and high-frequency sequential embedding, but also for the case of low-frequency.
An Improved Secret Key Estimation Method for Sequential Steganography
TLDR
An improved algorithm to detect the beginning and end of the secret message during low frequency embedding in sequential steganography through adjusting the log likelihood estimator, namely, increasing the power of the standard deviations and introducing the modulating factors, and then develops a new cumulative sum detector.
Forensic steganalysis: determining the stego key in spatial domain steganography
TLDR
It is shown that in the spatial domain the stego key search can be made significantly more efficient by working with the noise component of the image obtained using a denoising filter.
Stego Key Estimation in LSB Steganography
TLDR
This paper proposes a new method, in which the correct key can be identified by inspecting the difference between stego sequence and its shifted sequence on the embedding path, and shows that the new technique is much simpler and quicker than that previously known.

References

SHOWING 1-10 OF 13 REFERENCES
Practical steganalysis of digital images: state of the art
TLDR
This paper classify and review current stego-detection algorithms that can be used to trace popular steganographic products, and presents some new results regarding the previously proposed detection of LSB embedding using sensitive dual statistics.
A mathematical framework for active steganalysis
TLDR
It is concluded that a common belief, namely, spread spectrum steganography/watermarking, is secure because the low strength, noise-like message carrier is no longer valid within the current context.
Active steganalysis of sequential steganography
TLDR
Experiments show that the proposed method can be used quite effectively to detect locations and length of messages embedded using spread spectrum steganography.
Steganalysis using image quality metrics
TLDR
Simulation results with the chosen feature set and well-known watermarking and steganographic techniques indicate that the proposed approach is able with reasonable accuracy to distinguish between cover and stego images.
Detecting Steganographic Messages in Digital Images
TLDR
The basic approach taken here works by finding predictable higher-order statistics of ``natural'' images within a multi-scale decomposition, and then showing that embedded messages alter these statistics.
DCT-domain watermarking techniques for still images: detector performance analysis and a new structure
TLDR
Analysis of a spread-spectrum-like discrete cosine transform (DCT) domain watermarking technique for copyright protection of still digital images is analyzed and analytical expressions for performance measures are derived and contrasted with experimental results.
Attacks on Steganographic Systems
TLDR
This work presents both visual attacks, making use of the ability of humans to clearly discern between noise and visual patterns, and statistical attacks which are much easier to automate.
A new decoder for the optimum recovery of nonadditive watermarks
TLDR
A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image, and the results obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
Secure spread spectrum watermarking for multimedia
TLDR
It is argued that insertion of a watermark under this regime makes the watermark robust to signal processing operations and common geometric transformations provided that the original image is available and that it can be successfully registered against the transformed watermarked image.
Comparison of generalized Gaussian and Laplacian modeling in DCT image coding
TLDR
Generalized Gaussian and Laplacian source models are compared in discrete cosine transform (DCT) image coding and with block classification based on AC energy, the densities of the DCT coefficients are much closer to the LaPLacian or even the Gaussian.
...
...