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.

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 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.

High capacity reversible data hiding in encrypted image based on image encoding and POB

2020 ◽  
Vol 357 (13) ◽  
pp. 9107-9126
Author(s):  
Hang Gao ◽  
Tiegang Gao ◽  
Zhaoning You ◽  
Renhong Cheng
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Image Encoding ◽  
Encrypted Image

scholarly journals Reversible Data Hiding in Encrypted Color Halftone Images with High Capacity

2019 ◽  
Vol 9 (24) ◽  
pp. 5311 ◽  
Author(s):  
Yu-Xia Sun ◽  
Bin Yan ◽  
Jeng-Shyang Pan ◽  
Hong-Mei Yang ◽  
Na Chen
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Visual Quality ◽  
Cover Image ◽  
Embedding Capacity ◽  
Watermark Embedding ◽  
Continuous Tone ◽  
High Embedding Capacity ◽  
Halftone Images

In recent years, reversible data hiding (RDH) has become a research hotspot in the field of multimedia security that has aroused more and more researchers’ attention. Most of the existing RDH algorithms are aiming at continuous-tone images. For RDH in encrypted halftone images (RDH-EH), the original cover image cannot be recovered losslessly after the watermark is extracted. For some application scenarios such as medical or military images sharing, reversibility is critical. In this paper, a reversible data hiding scheme in encrypted color halftone images (RDH-ECH) is proposed. In the watermark embedding procedure, the cover image is copied into two identical images to increase redundancy. We use wet paper code to embed the watermark into the image blocks. Thus, the receiver only needs to process the image blocks by the check matrices in order to extract the watermarks. To increase embedding capacity, we embed three layers in the embedding procedure and combine the resulting images into one image for convenience of transmission. From the experimental results, it can be concluded that the original image can be restored entirely after the watermarks are extracted. Besides, for marked color halftone images, our algorithm can implement high embedding capacity and moderate visual quality.

scholarly journals Real-Time Error-Free Reversible Data Hiding in Encrypted Images Using (7, 4) Hamming Code and Most Significant Bit Prediction

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 51 ◽  
Author(s):  
Kaimeng Chen ◽  
Chin-Chen Chang
Keyword(s):  
Real Time ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Hamming Code ◽  
Time Error ◽  
Secret Data ◽  
Encrypted Image ◽  
Additional Information ◽  
Prediction Scheme ◽  
Encrypted Images

In this paper, a novel, real-time, error-free, reversible data hiding method for encrypted images has been proposed. Based on the (7, 4) Hamming code, we designed an efficient encoding scheme to embed secret data into the least significant bits (LSBs) of the encrypted image. For reversibility, we designed a most significant bit (MSB) prediction scheme that can recover a portion of the modified MSBs after the image is decrypted. These MSBs can be modified to accommodate the additional information that is used to recover the LSBs. After embedding the data, the original image can be recovered with no error and the secret data can be extracted from both the encrypted image and the decrypted image. The experimental results proved that compared with existing methods, the proposed method can achieve higher embedding rate, better quality of the marked image and less execution time of data embedding. Therefore, the proposed method is suitable for real-time applications in the cloud.

Sign in / Sign up

Export Citation Format

Share Document