Robust RDH Technique using Sorting and IPVO-based Pairwise PEE for Secure Communication

2022 ◽  
Vol 11 (2) ◽  
pp. 0-0

Nowadays, Reversible Data Hiding (RDH) is used extensively in information sensitive communication domains to protect the integrity of hidden data and the cover medium. However, most of the recently proposed RDH methods lack robustness. Robust RDH methods are required to protect the hidden data from security attacks at the time of communication between the sender and receiver. In this paper, we propose a Robust RDH scheme using IPVO based pairwise embedding. The proposed scheme is designed to prevent unintentional modifications caused to the secret data by JPEG compression. The cover image is decomposed into two planes namely HSB plane and LSB plane. As JPEG compression most likely modifies the LSBs of the cover image during compression, it is best not to hide the secret data into LSB planes. So, the proposed method utilizes a pairwise embedding to embed secret data into HSB plane of the cover image. High fidelity improved pixel value ordering (IPVO) based pairwise embedding ensures that the embedding performance of the proposed method is improved.

2020 ◽  
Vol 16 (7) ◽  
pp. 155014772091100
Author(s):  
Pyung-Han Kim ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung

In this article, a new reversible data hiding scheme using pixel-value differencing in dual images is proposed. The proposed pixel-value differencing method can embed more secret data as the difference value of adjacent pixels is increased. In the proposed scheme, the cover image is divided into non-overlapping blocks and the maximum difference value is calculated to hide secret bits. On the sender side, the length of embeddable secret data is calculated by using the maximum difference value and the log function, and the decimal secret data are embedded into the two stego-images after applying the ceil function and floor function. On the receiver side, the secret data extraction and the cover image restoration can be performed by using the correlation between two stego-images. After recovering the cover image from two stego-images, the secret data can be extracted using the maximum difference value and the log function. The experimental results show that the proposed scheme has a higher embedding capacity and the proposed scheme differs in embedding the secret data depending on the characteristics of the cover image with less distortion. Also, the proposed scheme maintains the degree of image distortion that cannot be perceived by the human visual system.


2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.


2018 ◽  
Vol 78 (6) ◽  
pp. 7125-7141 ◽  
Author(s):  
Fuqiang Di ◽  
Minqing Zhang ◽  
Xin Liao ◽  
Jia Liu

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shun Zhang ◽  
Tiegang Gao ◽  
Guorui Sheng

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.


2018 ◽  
Vol 10 (2) ◽  
pp. 1-22 ◽  
Author(s):  
Kai Chen ◽  
Dawen Xu

Reversible data hiding in the encrypted domain is an emerging technology, as it can preserve the confidentiality. In this article, an efficient method of reversible data hiding in encrypted images is proposed. The cover image is first partitioned into non-overlapping blocks. A specific modulo addition operation and block-scrambling operation are applied to obtain the encrypted image. The data-hider, who does not know the original image content, may reversibly embed secret data based on the homomorphic property of the cryptosystem. A scale factor is utilized for selecting embedding zone, which is scalable for different capacity requirements. At the receiving end, the additional data can be extracted if the receiver has the data-hiding key only. If the receiver has the encryption key only, he/she can recover the original image approximately. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original content without any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.


Symmetry ◽  
2020 ◽  
Vol 12 (7) ◽  
pp. 1164
Author(s):  
Chin-Feng Lee ◽  
Jau-Ji Shen ◽  
Yi-Jhen Wu ◽  
Somya Agrawal

Recently, Li et al. proposed a data hiding method based on pixel value ordering (PVO) and prediction error expansion (PEE). In their method, maximum and minimum values were predicted and the pixel values were modified to embed secret data. Thereafter, many scholars have proposed improvisations to the original PVO method. In this paper, a Reversible data hiding (RDH) method is proposed where the secret data is dispersed into two layers using different modes of operations. The second layer changes the dividing mode, and the first and the second layers do not take duplicate blocks. Under a fixed embedding capacity, threshold value and block size are controlled, complex blocks are filtered and the secret data is hidden in smooth blocks. This paper also compares the effectiveness of four well-known PVO series methods, the latest PVO methods, difference expansion (DE) method and reduced difference expansion (RDE) method. Experimental results show that the proposed method reduces distortion in the image, thereby enhancing the visual symmetry/quality compared to previous state-of-the-art methods and increasing its high application value.


Sign in / Sign up

Export Citation Format

Share Document