Reversible Data Hiding for Encrypted Image Based on Interpolation Error Expansion

2018 ◽  
Vol 9 (4) ◽  
pp. 76-96 ◽  
Author(s):  
Fuqiang Di ◽  
Minqing Zhang ◽  
Yingnan Zhang ◽  
Jia Liu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Side Information ◽  
Signal To Noise Ratio ◽  
Prediction Method ◽  
Interpolation Error ◽  
Encrypted Image ◽  
Error Expansion ◽  
Pixel Correlation ◽  
Embedding Performance

A novel reversible data hiding algorithm for encrypted image based on interpolation error expansion is proposed. The proposed method is an improved version of Shiu' s. His work does not make full use of the correlation of the neighbor pixels and some additional side information is needed. The proposed method adopts the interpolation prediction method to fully exploit the pixel correlation and employ the Paillier public key encryption method. The algorithm is reversible. In the proposed method, less side information is demanded. The experiment has verified the feasibility and effectiveness of the proposed method, and the better embedding performance can be obtained, compared with some existing RDHEI-P methods. Specifically, the final embedding capacity can be up to 0.74 bpp (bit per pixel), while the peak signal-to-noise ratio (PSNR) for the marked image Lena is 35 dB. This is significantly higher than Shiu's method which is about 0.5 bpp.

Reversible data hiding method based on pixel expansion and homomorphic encryption

2020 ◽  
Vol 39 (3) ◽  
pp. 2977-2990
Author(s):  
R. Anushiadevi ◽  
Padmapriya Praveenkumar ◽  
John Bosco Balaguru Rayappan ◽  
Rengarajan Amirtharajan
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Homomorphic Encryption ◽  
Secret Message ◽  
Pixel Expansion ◽  
Stego Image ◽  
Encrypted Image ◽  
Location Map

Digital image steganography algorithms usually suffer from a lossy restoration of the cover content after extraction of a secret message. When a cover object and confidential information are both utilised, the reversible property of the cover is inevitable. With this objective, several reversible data hiding (RDH) algorithms are available in the literature. Conversely, because both are diametrically related parameters, existing RDH algorithms focus on either a good embedding capacity (EC) or better stego-image quality. In this paper, a pixel expansion reversible data hiding (PE-RDH) method with a high EC and good stego-image quality are proposed. The proposed PE-RDH method was based on three typical RDH schemes, namely difference expansion, histogram shifting, and pixel value ordering. The PE-RDH method has an average EC of 0.75 bpp, with an average peak signal-to-noise ratio (PSNR) of 30.89 dB. It offers 100% recovery of the original image and confidential hidden messages. To protect secret as well as cover the proposed PE-RDH is also implemented on the encrypted image by using homomorphic encryption. The strength of the proposed method on the encrypted image was verified based on a comparison with several existing methods, and the approach achieved better results than these methods in terms of its EC, location map size and imperceptibility of directly decrypted images.

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 Reversible Data Hiding in Encrypted Images Using Median Edge Detector and Two’s Complement

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 921
Author(s):  
Rui Wang ◽  
Guohua Wu ◽  
Qiuhua Wang ◽  
Lifeng Yuan ◽  
Zhen Zhang ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Personal Information ◽  
Rapid Development ◽  
Prediction Method ◽  
Prediction Errors ◽  
Edge Detector ◽  
Secret Data ◽  
Encrypted Images ◽  
Cloud Servers

With the rapid development of cloud storage, an increasing number of users store their images in the cloud. These images contain many business secrets or personal information, such as engineering design drawings and commercial contracts. Thus, users encrypt images before they are uploaded. However, cloud servers have to hide secret data in encrypted images to enable the retrieval and verification of massive encrypted images. To ensure that both the secret data and the original images can be extracted and recovered losslessly, researchers have proposed a method that is known as reversible data hiding in encrypted images (RDHEI). In this paper, a new RDHEI method using median edge detector (MED) and two’s complement is proposed. The MED prediction method is used to generate the predicted values of the original pixels and calculate the prediction errors. The adaptive-length two’s complement is used to encode the most prediction errors. To reserve room, the two’s complement is labeled in the pixels. To record the unlabeled pixels, a label map is generated and embedded into the image. After the image has been encrypted, it can be embedded with the data. The experimental results indicate that the proposed method can reach an average embedding rate of 2.58 bpp, 3.04 bpp, and 2.94 bpp on the three datasets, i.e., UCID, BOSSbase, BOWS-2, which outperforms the previous work.

scholarly journals Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Ching-Yu Yang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Secret Image Sharing ◽  
Signal To Noise ◽  
Host Medium ◽  
Secret Image ◽  
Image Sharing ◽  
Host Image ◽  
Acs Algorithm

This paper proposes a novel form of reversible data hiding using two marked images by employing the adaptive coefficient-shifting (ACS) algorithm. The proposed ACS algorithm consists of three parts: the minimum-preserved scheme, the minimum-preserved with squeezing scheme, and the base-value embedding scheme. More specifically, each input block of a host image can be encoded to two stego-blocks according to three predetermined rules by the above three schemes. Simulations validate that the proposed method not only completely recovers the host medium but also losslessly extracts the hidden message. The proposed method can handle various kinds of images without any occurrence of overflow/underflow. Moreover, the payload and peak signal-to-noise ratio (PSNR) performance of the proposed method is superior to that of the conventional invertible data hiding schemes. Furthermore, the number of shadows required by the proposed method is less than that required by the approaches which are based upon secret image sharing with reversible steganography.

Sign in / Sign up

Export Citation Format

Share Document