Data hiding using integer lifting wavelet transform and DNA computing

DNA computing widely used in encryption or hiding the data. Many researchers have proposed many developments of encryption and hiding algorithms based on DNA sequence to provide new algorithms. In this paper data hiding using integer lifting wavelet transform based on DNA computing is presented. The transform is applied on blue channel of the cover image. The DNA encoding used to encode the two most significant bits of LL sub-band. The produced DNA sequence used for two purpose, firstly, it use to construct the key for encryption the secret data and secondly to select the pixels in HL, LH, HH sub-bands for hiding in them. Many measurement parameters used to evaluate the performance of the proposed method such PSNR, MSE, and SSIM. The experimental results show high performance with respect to different embedding rate

Capacity and Random-Coding Exponents for Channel Coding with Side Information

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is to be reliably transmitted through a noisy channel with finite input and output alphabets and random state sequence, and the channel is selected by a hypothetical adversary. Partial information about the state sequence is available to the encoder, adversary, and decoder. The design of the transmitter is subject to a cost constraint. Two families of channels are considered: 1) compound discrete memoryless channels (CDMC), and 2) channels with arbitrary memory, subject to an additive cost constraint, or more generally to a hard constraint on the conditional type of the channel output given the input. Both problems are closely connected. The random-coding exponent is achieved using a stacked binning scheme and a maximum penalized mutual information decoder, which may be thought of as an empirical generalized Maximum a Posteriori decoder. For channels with arbitrary memory, the random-coding exponents are larger than their CDMC counterparts. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers, and problems such as broadcast channels, all of which involve the fundamental idea of binning.Comment: to appear in IEEE Transactions on Information Theory, without Appendices G and

Data hiding techniques in steganography using fibonacci sequence and knight tour algorithm

The foremost priority in the information and communication technology era, is achieving an efficient and accurate steganography system for hiding information. The developed system of hiding the secret message must capable of not giving any clue to the adversaries about the hidden data. In this regard, enhancing the security and capacity by maintaining the Peak Signal-to-Noise Ratio (PSNR) of the steganography system is the main issue to be addressed. This study proposed an improved for embedding secret message into an image. This newly developed method is demonstrated to increase the security and capacity to resolve the existing problems. A binary text image is used to represent the secret message instead of normal text. Three stages implementations are used to select the pixel before random embedding to select block of (64 × 64) pixels, follows by the Knight Tour algorithm to select sub-block of (8 × 8) pixels, and finally by the random pixels selection. For secret embedding, Fibonacci sequence is implemented to decomposition pixel from 8 bitplane to 12 bitplane. The proposed method is distributed over the entire image to maintain high level of security against any kind of attack. Gray images from the standard dataset (USC-SIPI) including Lena, Peppers, Baboon, and Cameraman are implemented for benchmarking. The results show good PSNR value with high capacity and these findings verified the worthiness of the proposed method. High complexities of pixels distribution and replacement of bits will ensure better security and robust imperceptibility compared to the existing systems in the literature

An image steganography using improved hyper-chaotic Henon map and fractal Tromino

Steganography is a vital security approach that hides any secret content within ordinary data, such as multimedia. First, the cover image is converted into a wavelet environment using the integer wavelet transform (IWT), which protects the cover images from false mistakes. The grey wolf optimizer (GWO) is used to choose the pixel’s image that would be utilized to insert the hidden image in the cover image. GWO effectively selects pixels by calculating entropy, pixel intensity, and fitness function using the cover images. Moreover, the secret image was encrypted by utilizing a proposed hyper-chaotic improved Henon map and fractal Tromino. The suggested method increases computational security and efficiency with increased embedding capacity. Following the embedding algorithm of the secret image and the alteration of the cover image, the least significant bit (LSB) is utilized to locate the tempered region and to provide self-recovery characteristics in the digital image. According to the findings, the proposed technique provides a more secure transmission network with lower complexity in terms of peak signal-to-noise ratio (PSNR), normalized cross correlation (NCC), structural similarity index (SSIM), entropy and mean square error (MSE). As compared to the current approaches, the proposed method performed better in terms of PSNR 70.58% Db and SSIM 0.999 respectively

LWT based encrypted payload steganography

Steganography is used in covert communication for transportation of secrete information. In this paper we propose LWT based Encrypted Payload Steganography (LEPS). The payload is segmented into two parts say block 1 and block 2. The LWT is applied on block 2 to generate four sub bands. Payload block 1 is retained in the spatial domain itself. The values of approximation band coefficients of block 2 and spatial domain intensity values of block 1 are compressed. The LWT is applied on cover image to generate wavelet sub bands and considered only diagonal sub bands (XD). The XD band is decomposed into three parts. The key values are embedded into first part of XD band. The compressed payload is embedded in second and third blocks of XD adaptively. The payload can be retrieved at the destination by adapting reverse process of embedding. It is observed that the values of PSNR and capacity are better in the case of proposed algorithm compared to existing algorithm