Reversible data hiding in chaotic encryption domain based on odevity verification

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.

Download Full-text

Block-Based Reversible Data Hiding Using Histogram Shifting and Modulus Operator for Digital Images

Journal of Circuits System and Computers ◽

10.1142/s0218126617501031 ◽

2017 ◽

Vol 26 (06) ◽

pp. 1750103 ◽

Cited By ~ 3

Author(s):

Pankaj Garg ◽

Singara Singh Kasana ◽

Geeta Kasana

Keyword(s):

Data Hiding ◽

Reversible Data Hiding ◽

Signal To Noise Ratio ◽

Cover Image ◽

Histogram Shifting ◽

Embedding Capacity ◽

Signal To Noise ◽

Secret Data ◽

Peak Points ◽

Block Based

A Reversible Data Hiding technique by using histogram shifting and modulus operator is proposed in which secret data is embedded into blocks of the cover image. These blocks are modified by using modulus operator to increase the number of peak points in the histogram of the cover image which further increases its embedding capacity. Secret data is embedded in the original cover blocks of the cover image by using peak points of the predicted blocks, which are generated by using modulus operator. Peak Signal to Noise Ratio and PSNR-Human Visual System are used to show the human visual acceptance of the proposed technique. Experimental results show that the embedding capacity is high as compared to the capacity of existing RDH techniques, while distortion in marked images is also less as compared to distortion produced by these existing techniques.

Download Full-text

AN EFFECTIVE REVERSIBLE DATA HIDING METHOD BASED ON PIXEL-VALUE-ORDERING

Journal of Computer Science and Cybernetics ◽

10.15625/1813-9663/36/2/14084 ◽

2020 ◽

Vol 36 (2) ◽

pp. 139-158

Author(s):

Nguyen Kim Sao ◽

Nguyen Ngoc Hoa ◽

Pham Van At

Keyword(s):

Image Quality ◽

Data Hiding ◽

Reversible Data Hiding ◽

New Method ◽

Embedding Capacity ◽

Stego Image ◽

Pixel Value ◽

Using Data ◽

Location Map ◽

Better Than

This paper presents a new effective reversible data hiding method based on pixel-value-ordering (iGePVO-K) which is improvement of a recent GePVO-K method that recently is considered as a PVO-used method having highest embedding capacity. In comparison with GePVO-K method, iGePVO-K has the following advantages. First, the embedding capacity of the new method is higher than that of GePVO-K method by using data embedding formulas reasonably and reducing the location map size. Second, for embedding data, in the new method, each pixel value is modified at most by one, while in GePVO-K method, each pixel value may be modified by two. In fact, in the GePVO-K method, the largest pixels are modified by two for embedding bits 1 and by one for bits 0. This is also true for the smallest pixels. Meanwhile, in the proposed method, the largest pixels are modified by one for embedding bits 1 and are unchanged if embedding bits 0. Therefore, the stego-image quality in proposed method is better than that in GePVO-K method. Theoretical analysis and experiment results show that the proposed method has higher embedding capacity and better stego image quality than GePVO-K method.

Download Full-text

High-Capacity Reversible Data Hiding Using Modified Pixel Value Ordering Approach

Journal of Circuits System and Computers ◽

10.1142/s021812661850175x ◽

2018 ◽

Vol 27 (11) ◽

pp. 1850175 ◽

Cited By ~ 1

Author(s):

Neeraj Kumar Jain ◽

Singara Singh Kasana

Keyword(s):

Data Hiding ◽

Reversible Data Hiding ◽

High Capacity ◽

Visual Quality ◽

Experimental Results ◽

Cover Image ◽

Embedding Capacity ◽

Signal Process ◽

Pixel Value

The proposed reversible data hiding technique is the extension of Peng et al.’s technique [F. Peng, X. Li and B. Yang, Improved PVO-based reversible data hiding, Digit. Signal Process. 25 (2014) 255–265]. In this technique, a cover image is segmented into nonoverlapping blocks of equal size. Each block is sorted in ascending order and then differences are calculated on the basis of locations of its largest and second largest pixel values. Negative predicted differences are utilized to create empty spaces which further enhance the embedding capacity of the proposed technique. Also, the already sorted blocks are used to enhance the visual quality of marked images as pixels of these blocks are more correlated than the unsorted pixels of the block. Experimental results show the effectiveness of the proposed technique.

Download Full-text

Reversible Data Hiding Based on Adaptive Block Selection Strategy

International Journal of Digital Crime and Forensics ◽

10.4018/ijdcf.2020010108 ◽

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.

Download Full-text

High-Capacity and High-Quality Reversible Data Hiding Method Using Recurrent Round-Trip Embedding Strategy in the Quotient Image

Applied Sciences ◽

10.3390/app112110157 ◽

2021 ◽

Vol 11 (21) ◽

pp. 10157

Author(s):

Chin-Feng Lee ◽

Hua-Zhe Wu

Keyword(s):

Image Quality ◽

Data Hiding ◽

Information Hiding ◽

Reversible Data Hiding ◽

High Capacity ◽

Secret Message ◽

Embedding Capacity ◽

Round Trip ◽

Pixel Value ◽

Embedding Strategy

In previous research, scholars always think about how to improve the information hiding algorithm and strive to have the largest embedding capacity and better image quality, restoring the original image. This research mainly proposes a new robust and reversible information hiding method, recurrent robust reversible data hiding (triple-RDH), with a recurrent round-trip embedding strategy. We embed the secret message in a quotient image to increase the image robustness. The pixel value is split into two parts, HiSB and LoSB. A recurrent round-trip embedding strategy (referred to as double R-TES) is designed to adjust the predictor and the recursive parameter values, so the pixel value carrying the secret data bits can be first shifted to the right and then shifted to the left, resulting in pixel invariance, so the embedding capacity can be effectively increased repeatedly. Experimental results show that the proposed triple-RDH method can effectively increase the embedding capacity up to 310,732 bits and maintain a certain level of image quality. Compared with the existing pixel error expansion (PEE) methods, the triple-RDH method not only has a high capacity but also has robustness for image processing against unintentional attacks. It can also be used for capacity and image quality according to the needs of the application, performing adjustable embedding.

Download Full-text

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

Mathematics ◽

10.3390/math9172166 ◽

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.

Download Full-text

Reversible Information Hiding Algorithm Based on Multikey Encryption

Wireless Communications and Mobile Computing ◽

10.1155/2020/8847559 ◽

2020 ◽

Vol 2020 ◽

pp. 1-10

Author(s):

Zhaohui Li ◽

Yiqing Wang ◽

Zhi Wang ◽

Zheli Liu ◽

Jian Zhang ◽

...

Keyword(s):

Spatial Correlation ◽

Data Hiding ◽

Information Hiding ◽

Reversible Data Hiding ◽

Rate Distortion ◽

Selection Method ◽

Original Image ◽

Embedding Capacity ◽

Reversible Information Hiding ◽

Encrypted Images

This paper proposes a scheme of reversible data hiding in encrypted images based on multikey encryption. There are only two parties that are involved in this framework, including the content owner and the recipient. The content owner encrypts the original image with a key set which is composed by a selection method according to the additional message. Thus, the image can be encrypted and embedded at the same time. Additional message can be extracted given that the recipient side could perform decryption strategy by exploiting spatial correlation; then, original image can be recovered without any loss. Compare with other current information hiding mechanism, the proposed approach provides higher embedding capacity and is also able to perfectly reconstruct the original image as well as the embedded message. Rate distortion of the proposed method outperforms the previously published ones.

Download Full-text

REVERSIBLE DATA HIDING BASED ON PIXEL-BASED PIXEL VALUE ORDERING PREDICTOR AND EMD

Scientific Journal of Tra Vinh University ◽

10.35382/18594816.1.1.2019.82 ◽

2019 ◽

Vol 1 (1) ◽

pp. 14-19

Author(s):

Nam Hoang Tram ◽

Thanh Van Huynh ◽

C Thanh Vo ◽

Khanh Ngoc Van Duong ◽

Son Thai Nguyen

Keyword(s):

Image Quality ◽

Data Hiding ◽

Reversible Data Hiding ◽

Experimental Results ◽

Quality Changes ◽

Original Image ◽

Pixel Value

In this paper, we improved the reversible data hiding method of Qu’s et al. The original image is divided into overlapped equalsize blocks (2x2). Each of block is used to predict a pixel. Then a histogram is constructed from the different value between the original pixel and the prediction pixel. In order to increase thecapacity, the proposed method combination with EMD table to change the histogram. According to Qu’s method, each pixel satisfies only one bit of information is embedded. In our method, by using the EMD table, each pair of eligible pixels can embed three bits of information. Experimental results show that the proposed method increases 1.5 times the hidden performance while the image quality changes negligibly.

Download Full-text

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

Applied Sciences ◽

10.3390/app10062058 ◽

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.

Download Full-text