A Spatial Domain Image Steganography Technique Based on Plane Bit Substitution Method

Steganography is the art and science of hiding information by embedding data into cover media. In this paper we propose a new method of information hiding in digital image in spatial domain. In this method we use Plane Bit Substitution Method (PBSM) technique in which message bits are embedded into the pixel value(s) of an image. We first, proposed a Steganography transformation machine (STM) for solving Binary operation for manipulation of original image with help to least significant bit (LSB) operator based matching. Second, we use pixel encryption and decryption techniques under theoretical and experimental evolution. Our experimental, techniques are sufficient to discriminate analysis of stego and cover image as each pixel based PBSM, and operand with LSB

Side-Information For Steganography Design And Detection

Today, the most secure steganographic schemes for digital images embed secret messages while minimizing a distortion function that describes the local complexity of the content. Distortion functions are heuristically designed to predict the modeling error, or in other words, how difficult it would be to detect a single change to the original image in any given area. This dissertation investigates how both the design and detection of such content-adaptive schemes can be improved with the use of side-information. We distinguish two types of side-information, public and private: Public side-information is available to the sender and at least in part also to anybody else who can observe the communication. Content complexity is a typical example of public side-information. While it is commonly used for steganography, it can also be used for detection. In this work, we propose a modification to the rich-model style feature sets in both spatial and JPEG domain to inform such feature sets of the content complexity. Private side-information is available only to the sender. The previous use of private side-information in steganography was very successful but limited to steganography in JPEG images. Also, the constructions were based on heuristic with little theoretical foundations. This work tries to remedy this deficiency by introducing a scheme that generalizes the previous approach to an arbitrary domain. We also put forward a theoretical investigation of how to incorporate side-information based on a model of images. Third, we propose to use a novel type of side-information in the form of multiple exposures for JPEG steganography

A new cost function for spatial image steganography based on 2D-SSA and WMF.

As an essential tool for secure communications, adaptive steganography aims to communicate secret information with the least security cost. Inspired by the Ranking Priority Profile (RPP), we propose a novel two-step cost function for adaptive steganography in this paper. The RPP mainly includes three rules, i.e. Complexity-First rule, the Clustering rule and the Spreading rule, to design a cost function. We use the two-dimensional Singular Spectrum Analysis (2D-SSA) and Weighted Median Filter (WMF) in designing the two-step cost function. The 2D-SSA is employed in selecting the key components and clustering the embedding positions, which follows the Complexity-First rule and the Clustering rule. Also, we deploy the Spreading rule to smooth the resulting image produced by 2D-SSA with WMF. Extensive experiments have shown the efficacy of the proposed method, which has improved performance over four benchmarking approaches against non-shared selection channel attack. It also provides comparable performance in selection-channel-aware scenarios, where the best results are observed when the relative payload is 0.3 bpp or larger. Besides, the proposed approach is much faster than other model-based methods