Secured Data Transmission through Dual Domain Reversible Data Hiding and Encryption in Images
01 Feb 2020-
TL;DR: Simulation results obtained show the algorithm gives good embedding capacity; also the encrypted images are validated against key sensitivity, statistical and differential attacks.
Abstract: Communication of images has become very easy and frequent due to popularity of internet. But this fast moving world is prone to various threats from unauthorized users. To protect images and maintain privacy of data many data hiding and encryption techniques are developed. In this paper, a novel reversible 2-stage data hiding algorithm with chaotic based encryption using DNA encoding is proposed. Firstly, Integer Wavelet Transform (IWT) is applied on cover image to convert it from spatial to transform domain. Then, 1st level of data hiding is carried out using threshold based histogram shifting algorithm. Resultant image is interpolated to double of its size and second level of data hiding is done using adaptive prediction error expansion. This stego image is scrambled using chaotic logistic map, result is then DNA encoded using complementary rules. The encoded image is then XOR with a key image generated using hash function and chaotic map. Finally, encrypted image is obtained by DNA decoding the image. Simulation results obtained show the algorithm gives good embedding capacity; also the encrypted images are validated against key sensitivity, statistical and differential attacks
Citations
More filters
Journal Article•
TL;DR: In this article, a reversible data hiding scheme based on histogram modification is proposed, where the binary tree structure is exploited to solve the problem of communicating pairs of peak points and the distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low.
Abstract: In this letter, we present a reversible data hiding scheme based on histogram modification. We exploit a binary tree structure to solve the problem of communicating pairs of peak points. Distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low. We also adopt a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing schemes are provided to demonstrate the superiority of the proposed scheme.
12 citations
References
More filters
TL;DR: It is proved analytically and shown experimentally that the peak signal-to-noise ratio of the marked image generated by this method versus the original image is guaranteed to be above 48 dB, which is much higher than that of all reversible data hiding techniques reported in the literature.
Abstract: A novel reversible data hiding algorithm, which can recover the original image without any distortion from the marked image after the hidden data have been extracted, is presented in this paper. This algorithm utilizes the zero or the minimum points of the histogram of an image and slightly modifies the pixel grayscale values to embed data into the image. It can embed more data than many of the existing reversible data hiding algorithms. It is proved analytically and shown experimentally that the peak signal-to-noise ratio (PSNR) of the marked image generated by this method versus the original image is guaranteed to be above 48 dB. This lower bound of PSNR is much higher than that of all reversible data hiding techniques reported in the literature. The computational complexity of our proposed technique is low and the execution time is short. The algorithm has been successfully applied to a wide range of images, including commonly used images, medical images, texture images, aerial images and all of the 1096 images in CorelDraw database. Experimental results and performance comparison with other reversible data hiding schemes are presented to demonstrate the validity of the proposed algorithm.
2,240 citations
10 Dec 2002
TL;DR: A prediction-based conditional entropy coder which utilizes static portions of the host as side-information improves the compression efficiency, and thus the lossless data embedding capacity.
Abstract: We present a novel reversible (lossless) data hiding (embedding) technique, which enables the exact recovery of the original host signal upon extraction of the embedded information. A generalization of the well-known LSB (least significant bit) modification is proposed as the data embedding method, which introduces additional operating points on the capacity-distortion curve. Lossless recovery of the original is achieved by compressing portions of the signal that are susceptible to embedding distortion, and transmitting these compressed descriptions as a part of the embedded payload. A prediction-based conditional entropy coder which utilizes static portions of the host as side-information improves the compression efficiency, and thus the lossless data embedding capacity.
1,126 citations
"Secured Data Transmission through D..." refers methods in this paper
...In general, RDH methods [3] are developed by modifying the minimum and maximum gray scale values of the image histogram to hide data....
[...]
TL;DR: A novel reversible watermarking scheme using an interpolation technique, which can embed a large amount of covert data into images with imperceptible modification, and can provide greater payload capacity and higher image fidelity compared with other state-of-the-art schemes.
Abstract: Watermarking embeds information into a digital signal like audio, image, or video. Reversible image watermarking can restore the original image without any distortion after the hidden data is extracted. In this paper, we present a novel reversible watermarking scheme using an interpolation technique, which can embed a large amount of covert data into images with imperceptible modification. Different from previous watermarking schemes, we utilize the interpolation-error, the difference between interpolation value and corresponding pixel value, to embed bit ?1? or ?0? by expanding it additively or leaving it unchanged. Due to the slight modification of pixels, high image quality is preserved. Experimental results also demonstrate that the proposed scheme can provide greater payload capacity and higher image fidelity compared with other state-of-the-art schemes.
645 citations
"Secured Data Transmission through D..." refers methods in this paper
...To interpolate the image basic idea of [10] and [14] is used, but in order to obtain higher PSNR value with high embedding capacity, the ALMMSE algorithm is slightly modified as this algorithm interpolates both sample and un-sample pixels, but here only the un-sampled pixels are interpolated....
[...]
TL;DR: A binary tree structure is exploited to solve the problem of communicating pairs of peak points and distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low.
Abstract: In this letter, we present a reversible data hiding scheme based on histogram modification. We exploit a binary tree structure to solve the problem of communicating pairs of peak points. Distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low. We also adopt a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing schemes are provided to demonstrate the superiority of the proposed scheme.
550 citations
"Secured Data Transmission through D..." refers background in this paper
...Difference between adjacent pixels in histogram modification and binary tree for communicating pair of peak points is considered [4] to embed information....
[...]
TL;DR: Experimental results have demonstrated that the CDM-based RDH scheme can achieve the best performance at the moderate-to-high embedding capacity compared with other state-of-the-art schemes.
Abstract: In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented The covert data are denoted by different orthogonal spreading sequences and embedded into the cover image The original image can be completely recovered after the data have been extracted exactly The Walsh Hadamard matrix is employed to generate orthogonal spreading sequences, by which the data can be overlappingly embedded without interfering each other, and multilevel data embedding can be utilized to enlarge the embedding capacity Furthermore, most elements of different spreading sequences are mutually cancelled when they are overlappingly embedded, which maintains the image in good quality even with a high embedding payload A location-map free method is presented in this paper to save more space for data embedding, and the overflow/underflow problem is solved by shrinking the distribution of the image histogram on both the ends This would further improve the embedding performance Experimental results have demonstrated that the CDM-based RDH scheme can achieve the best performance at the moderate-to-high embedding capacity compared with other state-of-the-art schemes
140 citations
"Secured Data Transmission through D..." refers methods in this paper
...In order to overcome overflow of pixel values (less than 0 or greater than 255), ‘flag array’ method [12] can be used to shrink the data hidden image histogram from both the ends....
[...]