scholarly journals Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

2020 ◽  
Vol 10 (6) ◽  
pp. 2058
Author(s):  
Dewang Wang ◽  
Xianquan Zhang ◽  
Chunqiang Yu ◽  
Zhenjun Tang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Visual Quality ◽  
The Other ◽  
Prediction Errors ◽  
Original Image ◽  
Embedding Capacity ◽  
Encrypted Image ◽  
Embedding Strategy ◽  
Embedding Rate

In this paper, a reversible data hiding method in encrypted image (RDHEI) is proposed. Prior to image encryption, the embeddable pixels are selected from an original image according to prediction errors due to adjacent pixels with strong correlation. Then the embeddable pixels and the other pixels are both rearranged and encrypted to generate an encrypted image. Secret bits are directly embedded into the multiple MSBs (most significant bit) of the embeddable pixels in the encrypted image to generate a marked encrypted image during the encoding phase. In the decoding phase, secret bits can be extracted from the multiple MSBs of the embeddable pixels in the marked encrypted image. Moreover, the original embeddable pixels are restored losslessly by using correlation of the adjacent pixels. Thus, a reconstructed image with high visual quality can be obtained only when the encryption key is available. Since exploiting multiple MSBs of the embeddable pixels, the proposed method can obtain a very large embedding capacity. Experimental results show that the proposed method is able to achieve an average embedding rate as large as 1.7215 bpp (bits per pixel) for the BOW-2 database.

scholarly journals Reversible Data Hiding with Pixel Prediction and Additive Homomorphism for Encrypted Image

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Chunqiang Yu ◽  
Xianquan Zhang ◽  
Zhenjun Tang ◽  
Yan Chen ◽  
Jingyu Huang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Visual Quality ◽  
Input Image ◽  
Embedding Capacity ◽  
Secret Data ◽  
Encrypted Image ◽  
High Embedding Capacity ◽  
Additive Homomorphism

Data hiding in encrypted image is a recent popular topic of data security. In this paper, we propose a reversible data hiding algorithm with pixel prediction and additive homomorphism for encrypted image. Specifically, the proposed algorithm applies pixel prediction to the input image for generating a cover image for data embedding, referred to as the preprocessed image. The preprocessed image is then encrypted by additive homomorphism. Secret data is finally embedded into the encrypted image via modular 256 addition. During secret data extraction and image recovery, addition homomorphism and pixel prediction are jointly used. Experimental results demonstrate that the proposed algorithm can accurately recover original image and reach high embedding capacity and good visual quality. Comparisons show that the proposed algorithm outperforms some recent algorithms in embedding capacity and visual quality.

scholarly journals Reversible Data Hiding Based on Adaptive Block Selection Strategy

2020 ◽  
Vol 12 (1) ◽  
pp. 157-168
Author(s):  
Dan Huang ◽  
Fangjun Huang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Visual Quality ◽  
Original Method ◽  
Experimental Results ◽  
Selection Strategy ◽  
Original Image ◽  
Histogram Shifting ◽  
Carrier Image ◽  
Embedding Rate

Recently, a reversible data hiding (RDH) method was proposed based on local histogram shifting. This method selects the peak bin of the local histogram as a reference and expands the two neighboring bins of the peak bin to carry the message bits. Since the peak bin keeps unchanged during the embedding process, the neighboring bins can be easily identified at the receiver end, and the original image can be restored completely while extracting the embedded data. In this article, as an extension of the algorithm, the authors propose an RDH scheme based on adaptive block selection strategy. Via a new block selection strategy, those blocks of the carrier image may carry more message bits whereas introducing less distortion will take precedence over data hiding. Experimental results demonstrate that higher visual quality can be obtained compared with the original method, especially when the embedding rate is low.

scholarly journals Separable Reversible Data Hiding in Encrypted Image Based on Two-Dimensional Permutation and Exploiting Modification Direction

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 976
Author(s):  
Chunqiang Yu ◽  
Chenmei Ye ◽  
Xianquan Zhang ◽  
Zhenjun Tang ◽  
Shanhua Zhan
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
State Of The Art ◽  
Data Extraction ◽  
Visual Quality ◽  
Two Dimensional ◽  
Original Image ◽  
Encrypted Image ◽  
Peak Points ◽  
Exploiting Modification Direction

In this paper, we propose a separable reversible data hiding method in encrypted image (RDHEI) based on two-dimensional permutation and exploiting modification direction (EMD). The content owner uses two-dimensional permutation to encrypt original image through encryption key, which provides confidentiality for the original image. Then the data hider divides the encrypted image into a series of non-overlapping blocks and constructs histogram of adjacent encrypted pixel errors. Secret bits are embedded into a series of peak points of the histogram through EMD. Direct decryption, data extraction and image recovery can be performed separately by the receiver according to the availability of encryption key and data-hiding key. Different from some state-of-the-art RDHEI methods, visual quality of the directly decrypted image can be further improved by the receiver holding the encryption key. Experimental results demonstrate that the proposed method outperforms some state-of-the-art methods in embedding capacity and visual quality.

scholarly journals High-Capacity Reversible Data Hiding in Encrypted Images Based on Adaptive Predictor and Compression of Prediction Errors

Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2166
Author(s):  
Bin Huang ◽  
Chun Wan ◽  
Kaimeng Chen
Keyword(s):  
Image Encryption ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Huffman Coding ◽  
Prediction Errors ◽  
Original Image ◽  
Embedding Capacity ◽  
Secret Data ◽  
Encrypted Images

Reversible data hiding in encrypted images (RDHEI) is a technology which embeds secret data into encrypted images in a reversible way. In this paper, we proposed a novel high-capacity RDHEI method which is based on the compression of prediction errors. Before image encryption, an adaptive linear regression predictor is trained from the original image. Then, the predictor is used to obtain the prediction errors of the pixels in the original image, and the prediction errors are compressed by Huffman coding. The compressed prediction errors are used to vacate additional room with no loss. After image encryption, the vacated room is reserved for data embedding. The receiver can extract the secret data and recover the image with no errors. Compared with existing approaches, the proposed method efficiently improves the embedding capacity.

scholarly journals High-Capacity Reversible Data Hiding in Encrypted Images by Information Preprocessing

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Xi-Yan Li ◽  
Xia-Bing Zhou ◽  
Qing-Lei Zhou ◽  
Shi-Jing Han ◽  
Zheng Liu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Main Idea ◽  
Original Image ◽  
Chaos Encryption ◽  
Secret Information ◽  
Encrypted Image ◽  
Encrypted Images ◽  
Scanned Documents

With the development of cloud computing, high-capacity reversible data hiding in an encrypted image (RDHEI) has attracted increasing attention. The main idea of RDHEI is that an image owner encrypts a cover image, and then a data hider embeds secret information in the encrypted image. With the information hiding key, a receiver can extract the embedded data from the hidden image; with the encryption key, the receiver reconstructs the original image. In this paper, we can embed data in the form of random bits or scanned documents. The proposed method takes full advantage of the spatial correlation in the original images to vacate the room for embedding information before image encryption. By jointly using Sudoku and Arnold chaos encryption, the encrypted images retain the vacated room. Before the data hiding phase, the secret information is preprocessed by a halftone, quadtree, and S-BOX transformation. The experimental results prove that the proposed method not only realizes high-capacity reversible data hiding in encrypted images but also reconstructs the original image completely.

scholarly journals A Joint Encryption and Reversible Data Hiding Scheme Based on Integer-DWT and Arnold Map Permutation

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shun Zhang ◽  
Tiegang Gao ◽  
Guorui Sheng
Keyword(s):  
Frequency Domain ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Cover Image ◽  
Discrete Wavelet ◽  
Original Image ◽  
Histogram Modification ◽  
Encrypted Image ◽  
Hidden Data ◽  
Arnold Map

A joint encryption and reversible data hiding (joint encryption-RDH) scheme is proposed in this paper. The cover image is transformed to the frequency domain with integer discrete wavelet transform (integer DWT) for the encryption and data hiding. Additional data is hidden into the permuted middle (LH, HL) and high (HH) frequency subbands of integer DWT coefficients with a histogram modification based method. A combination of permutations both in the frequency domain and in the spatial domain is imposed for the encryption. In the receiving end, the encrypted image with hidden data can be decrypted to the image with hidden data, which is similar to the original image without hidden data, by only using the encryption key; if someone has both the data hiding key and the encryption key, he can both extract the hidden data and reversibly recover the original image. Experimental results demonstrate that, compared with existing joint encryption-RDH schemes, the proposed scheme has gained larger embedding capacity, and the distribution of the encrypted image with data hidden has a random like behavior. It can also achieve the lossless restoration of the cover image.

scholarly journals Reversible Data Hiding in a Chaotic Encryption Domain Based on Odevity Verification

2021 ◽  
Vol 13 (6) ◽  
pp. 1-14
Author(s):  
Lianshan Liu ◽  
Xiaoli Wang ◽  
Lingzhuang Meng ◽  
Gang Tian ◽  
Ting Wang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Chaotic Encryption ◽  
Original Image ◽  
Embedding Capacity ◽  
Logistic Mapping ◽  
Henon Mapping ◽  
Pixel Value ◽  
Carrier Image

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

scholarly journals Reversible Data Hiding for Encrypted Image Based on Arnold Transformation

2018 ◽  
Vol 173 ◽  
pp. 03088
Author(s):  
Dan Wu
Keyword(s):  
Data Hiding ◽  
Information Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Original Image ◽  
Good Image Quality ◽  
Encrypted Image ◽  
Secret Keys ◽  
The Difference ◽  
Arnold Transformation

A reversible data hiding scheme for encrypted image was proposed based on Arnold transformation. In this scheme, the original image was divided into four sub-images by sampling, the sub-images were scrambled by Arnold transformation using two secret keys, then the scrambled sub-images were reconstituted an encrypted image. Subsequently, additional data was embedded into the encrypted image by modifying the difference between two adjacent pixels. With an encrypted image containing additional data, the receiver can obtain a decrypt image using the decryption key. Meanwhile, with the aid of the decryption key and information hiding key, the receiver can pick the hiding information and recover the original image without any error. Experiment result shows that the proposed scheme can obtain a higher payload with good image quality.

scholarly journals High Capacity Reversible Data Hiding Based on the Compression of Pixel Differences

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1435
Author(s):  
Kai-Meng Chen
Keyword(s):  
Spatial Correlation ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Visual Quality ◽  
Small Range ◽  
Encryption Scheme ◽  
Secret Data ◽  
Encrypted Image ◽  
Block Level

In this paper, we proposed a novel reversible data hiding method in encrypted image (RDHEI), which is based on the compression of pixel differences. In the proposed method, at the content owner’ side the image is divided into non-overlapping blocks, and a block-level image encryption scheme is used to generate the encrypted image, which partially retains spatial correlation in the blocks. Due to the spatial correlation, in each block the pixels are highly likely to be similar. Therefore, the pixel differences in all blocks are concentrated in a small range and can be compressed. By the compression of pixel differences, the data hider can vacate the room to accommodate secret data in the encrypted image without losing information. At the receiver’s side, the receiver can obtain secret data or retrieve the original image using different keys with no error. The experimental results demonstrate that, compared with existing methods, the proposed method can achieve a higher capacity and visual quality.

On Performance Improvement Of Reversible Data Hiding With Contrast Enhancement

2020 ◽  
Vol 63 (10) ◽  
pp. 1584-1596
Author(s):  
Haishan Chen ◽  
Junying Yuan ◽  
Wien Hong ◽  
Jiangqun Ni ◽  
Tung-Shou Chen
Keyword(s):  
Contrast Enhancement ◽  
Performance Improvement ◽  
Data Hiding ◽  
Upper Bound ◽  
Reversible Data Hiding ◽  
Image Contrast ◽  
Embedding Capacity ◽  
Visible Image ◽  
Multiple Cycles ◽  
Embedding Rate

Abstract Reversible data hiding (RDH) with contrast enhancement (RDH-CE) is a special type of RDH in improving the subjective visual perception by enhancing the image contrast during the process of data embedding. In RDH-CE, data hiding is achieved via pairwise histogram expansion, and the embedding rate can be increased by performing multiple cycles of histogram expansions. However, when embedding rate gets high, human visible image degradation is observed. Previous work designed an upper bound of the embedding level for RDH-CE, which effectively avoids image over-sharping but offers limited embedding capacity. In this paper, a better tunable bound is designed to enhance the embedding capacity of RDH-CE by exploiting the characteristics of histogram distribution. Furthermore, the objective distortion introduced by histogram pre-shifting is minimized when the embedding level is no more than the upper bound, and the human visible degradation is minimized when the embedding level exceeds the limitation of the proposed upper bound. Experimental results validate that the proposed method provides appropriate upper bound of the embedding level, increases the effective embedding capacity and offers better image contrast.

Sign in / Sign up

Export Citation Format

Share Document