High-Capacity Reversible Data Hiding in Encrypted Images Based on Hierarchical Quad-Tree Coding and Multi-MSB Prediction

Nowadays, more and more researchers are interested in reversible data hiding in encrypted images (RDHEI), which can be applied in privacy protection and cloud storage. In this paper, a new RDHEI method on the basis of hierarchical quad-tree coding and multi-MSB (most significant bit) prediction is proposed. The content owner performs pixel prediction to obtain a prediction error image and explores the maximum embedding capacity of the prediction error image by hierarchical quad-tree coding before image encryption. According to the marked bits of vacated room capacity, the data hider can embed additional data into the room-vacated image without knowing the content of original image. Through the data hiding key and the encryption key, the legal receiver is able to conduct data extraction and image recovery separately. Experimental results show that the average embedding rates of the proposed method can separately reach 3.504 bpp (bits per pixel), 3.394 bpp, and 2.746 bpp on three well-known databases, BOSSBase, BOWS-2, and UCID, which are higher than some state-of-the-art methods.

Download Full-text

High capacity reversible data hiding in encrypted images based on prediction error and block classification

Multimedia Tools and Applications ◽

10.1007/s11042-021-11143-0 ◽

2021 ◽

Author(s):

Xu Wang ◽

Chin-Chen Chang ◽

Chia-Chen Lin

Keyword(s):

Data Hiding ◽

Prediction Error ◽

Reversible Data Hiding ◽

High Capacity ◽

Block Classification ◽

Encrypted Images

Download Full-text

High-capacity reversible data hiding in encrypted images by prediction error

Signal Processing ◽

10.1016/j.sigpro.2014.04.032 ◽

2014 ◽

Vol 104 ◽

pp. 387-400 ◽

Cited By ~ 104

Author(s):

Xiaotian Wu ◽

Wei Sun

Keyword(s):

Data Hiding ◽

Prediction Error ◽

Reversible Data Hiding ◽

High Capacity ◽

Encrypted Images

Download Full-text

Intra-Block Correlation Based Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

Symmetry ◽

10.3390/sym13061072 ◽

2021 ◽

Vol 13 (6) ◽

pp. 1072

Author(s):

Arun Kumar Rai ◽

Neeraj Kumar ◽

Rajeev Kumar ◽

Hari Om ◽

Satish Chand ◽

...

Keyword(s):

Data Hiding ◽

Binary Tree ◽

Reversible Data Hiding ◽

State Of The Art ◽

High Capacity ◽

Block Based ◽

Pixel Correlation ◽

Encrypted Images ◽

Labeling Scheme ◽

Embedding Rate

In this paper, a high capacity reversible data hiding technique using a parametric binary tree labeling scheme is proposed. The proposed parametric binary tree labeling scheme is used to label a plaintext image’s pixels as two different categories, regular pixels and irregular pixels, through a symmetric or asymmetric process. Regular pixels are only utilized for secret payload embedding whereas irregular pixels are not utilized. The proposed technique efficiently exploits intra-block correlation, based on the prediction mean of the block by symmetry or asymmetry. Further, the proposed method utilizes blocks that are selected for their pixel correlation rather than exploiting all the blocks for secret payload embedding. In addition, the proposed scheme enhances the encryption performance by employing standard encryption techniques, unlike other block based reversible data hiding in encrypted images. Experimental results show that the proposed technique maximizes the embedding rate in comparison to state-of-the-art reversible data hiding in encrypted images, while preserving privacy of the original contents.

Download Full-text

High-Capacity Reversible Data Hiding in Encrypted Images Based on Prediction Error Compression and Block Selection

Security and Communication Networks ◽

10.1155/2021/9606116 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Xu Wang ◽

Li-Yao Li ◽

Ching-Chun Chang ◽

Chih-Cheng Chen

Keyword(s):

Data Hiding ◽

Reversible Data Hiding ◽

Additional Data ◽

High Capacity ◽

Personal Data ◽

Huffman Coding ◽

Prediction Errors ◽

Original Image ◽

Block Based ◽

Encrypted Images

The popularity of cloud computing has impelled more users to upload personal data into the cloud server. The need for secure transmission and privacy protection has become a new challenge and has attracted considerable attention. In this paper, we propose a high-capacity reversible data hiding scheme in encrypted images (RDHEI) that compresses prediction errors in usable blocks of block-based encrypted images. On the content owner side, the original image is divided into 2 × 2 sized blocks, and each block is encrypted by block-based modulation. On the data hider side, an efficient block-based predictor is utilized to generate prediction errors. The Huffman coding technique is introduced to compress prediction errors in the usable blocks to embed abundant additional data. On the receiver side, the additional data can be totally extracted with a data hiding key and the original image can be losslessly recovered with an image encryption key. Experimental results demonstrate that the embedding rate of our proposed scheme is significantly improved compared to those of state-of-the-art schemes.

Download Full-text

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

Complexity ◽

10.1155/2020/6989452 ◽

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.

Download Full-text