scholarly journals A Reversible Data Hiding Scheme through Encryption using Rotated Stream Cipher

2021 ◽  
Vol 22 (2) ◽  
Author(s):  
V. M. Manikandan
Keyword(s):  
Image Encryption ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Image Transmission ◽  
Image Recovery ◽  
Secret Message ◽  
Encryption Scheme ◽  
Secret Data ◽  
Embedding Rate

The research in the domain of reversible data hiding got much attention in recent years due to its wide applications in medical image transmission and cloud computing.  Reversible data hiding during image encryption is a recently emerged framework for hiding secret data into an image during the image encryption process. In this manuscript, we propose a new reversible data hiding through encryption scheme which will ensure a high embedding rate without bringing any additional overhead of key handling. The proposed algorithm can use any secure symmetric encryption scheme, and the encryption and/or decryption key should be shared with the receiver for data extraction and image recovery. As per the proposed scheme, the data hider can hide three-bits of secret message in an image block of size $B\times B$ pixels. The data extraction image recovery will be carried out by analyzing the closeness between adjacent pixels. The simulation of the new scheme on the USC-SIPI dataset shows that the proposed scheme outperforms the well-known existing schemes in embedding rate and bit error rate.

scholarly journals Separable Reversible Data Hiding in Encrypted Images Based on Two-Dimensional Histogram Modification

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Dawen Xu ◽  
Kai Chen ◽  
Rangding Wang ◽  
Shubing Su
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Image Recovery ◽  
Two Dimensional ◽  
Secret Data ◽  
Histogram Modification ◽  
Encrypted Images ◽  
Difference Histogram ◽  
Image Difference

An efficient method of completely separable reversible data hiding in encrypted images is proposed. The cover image is first partitioned into nonoverlapping blocks and specific encryption is applied to obtain the encrypted image. Then, image difference in the encrypted domain can be calculated based on the homomorphic property of the cryptosystem. The data hider, who does not know the original image content, may reversibly embed secret data into image difference based on two-dimensional difference histogram modification. Data extraction is completely separable from image decryption; that is, data extraction can be done either in the encrypted domain or in the decrypted domain, so that it can be applied to different application scenarios. In addition, data extraction and image recovery are free of any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.

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 Reversible data hiding scheme based on pixel-value differencing in dual images

2020 ◽  
Vol 16 (7) ◽  
pp. 155014772091100
Author(s):  
Pyung-Han Kim ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Cover Image ◽  
Maximum Difference ◽  
Secret Data ◽  
Pixel Value ◽  
The Difference ◽  
Pixel Value Differencing ◽  
Dual Images

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.

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 Scheme with High Embedding Capacity Using Semi-Indicator-Free Strategy

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jiann-Der Lee ◽  
Yaw-Hwang Chiou ◽  
Jing-Ming Guo
Keyword(s):  
Vector Quantization ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Embedding Capacity ◽  
Bit Rate ◽  
Secret Data ◽  
Compressed Images ◽  
Search Order ◽  
High Embedding Capacity ◽  
Embedding Rate

A novel reversible data-hiding scheme is proposed to embed secret data into a side-matched-vector-quantization- (SMVQ-) compressed image and achieve lossless reconstruction of a vector-quantization- (VQ-) compressed image. The rather random distributed histogram of a VQ-compressed image can be relocated to locations close to zero by SMVQ prediction. With this strategy, fewer bits can be utilized to encode SMVQ indices with very small values. Moreover, no indicator is required to encode these indices, which yields extrahiding space to hide secret data. Hence, high embedding capacity and low bit rate scenarios are deposited. More specifically, in terms of the embedding rate, the bit rate, and the embedding capacity, experimental results show that the performance of the proposed scheme is superior to those of the former data hiding schemes for VQ-based, VQ/SMVQ-based, and search-order-coding- (SOC-) based compressed images.

scholarly journals Meaningful Image Encryption Based on Reversible Data Hiding in Compressive Sensing Domain

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Ming Li ◽  
Haiju Fan ◽  
Hua Ren ◽  
Dandan Lu ◽  
Di Xiao ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Compressive Sensing ◽  
Image Encryption ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Secret Image ◽  
Key Innovation ◽  
Novel Method ◽  
Embedding Rate ◽  
State Of Art

A novel method of meaningful image encryption is proposed in this paper. A secret image is encrypted into another meaningful image using the algorithm of reversible data hiding (RDH). High covertness can be ensured during the communication, and the possibility of being attacked of the secret image would be reduced to a very low level. The key innovation of the proposed method is that RDH is applied to compressive sensing (CS) domain, which brings a variety of benefits in terms of image sampling, communication and security. The secret image after preliminary encryption is embedded into the sparse representation coefficients of the host image with the help of the dictionary. The embedding rate could reach 2 bpp, which is significantly higher than those of other state-of-art schemes. In addition, the computational complexity of receiver is reduced. Simulations verify our proposal.

scholarly journals A Reversible Data Hiding Scheme in Encrypted Images for Medical Applications

2021 ◽  
pp. 166-172
Author(s):  
Dr. Rohith S ◽  
Harish V
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Image Recovery ◽  
Perceptual Quality ◽  
Medical Applications ◽  
Histogram Shifting ◽  
Novel Method ◽  
Encrypted Images ◽  
Excellent Property

Storage and exchange of data of the patient images are common in medical applications. To protect the information of the patient and to avoid miss handling of the patient information data hiding scheme is very much essential. Reversible Data Hiding (RDH) scheme is one such scheme paid more attention to hide the data in encrypted images, since it maintains the excellent property that the original cover can be lossless recovered after embedded data is extracted while protecting the image content’s confidentiality. In this paper initially space is reserved from the encrypted images, which may be used to embed the information later stage. Histogram shifting based Reversible Data Hiding scheme used to reserve the room before encryption process. The proposed method can achieve real reversibility, that is, data extraction and image recovery are free of any error. Experiments show that this novel method and achieves better perceptual quality.

scholarly journals Pixel Value Ordering Based Reversible Data Hiding with Novel MPBS Strategy

2020 ◽  
Vol 9 (3) ◽  
pp. 1518-1524
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Block Size ◽  
Selection Strategy ◽  
Secret Data ◽  
Unit Distance ◽  
Pixel Value ◽  
Block Based ◽  
Location Map

Recently, Reversible Data Hiding (RDH) techniques has gained much attention in many sensitive fields such as remote sensing, archive management, military and medical image processing systems. This is due to the lossless data extraction ability of RDH schemes. The primary goal of RDH schemes is to achieve high embedding rates while maintaining the quality of cover objects. For achieving better performance, Pixel Value Ordering (PVO) based reversible data hiding schemes have been proposed. PVO refers to the process of ranking the pixels in blocks and then modifying the pixels according to some embedding rules/conditions. So far, the existing PVO techniques have considered neighborhood pixels at unit distance. In this paper, an improved RDH using block based PVO scheme is proposed which exploits the pixel correlation efficiently by increasing the block size and applying a novel Median Pixel based Block Selection Strategy (MPBS). When block size is increased, the ordering of pixels is changed after embedding. So, to extract the secret data in a lossless manner, the secret bits are swapped in accordance with their corresponding Stego pixels’ index order. Also, the overflow and underflow conditions are effectively handled using Location Map. Experimental results show the better performance of the proposed RDH technique with the existing technique.

A Novel Method for High Capacity Reversible Data Hiding Scheme Using Difference Expansion

2019 ◽  
Vol 8 (4) ◽  
pp. 13-27
Author(s):  
Subhadip Mukherjee ◽  
Biswapati Jana
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
High Capacity ◽  
Correlation Coefficients ◽  
Extraction Process ◽  
Research Area ◽  
Difference Expansion ◽  
Secret Data ◽  
Hiding Capacity

Data hiding techniques are very significant in the research area of information security. In this article, the authors propose a new reversible data hiding (RDH) scheme using difference expansion. At first, the original image is partitioned into 3 × 3 pixel blocks, then marked Type-one and Type-two pixels based on their coordinate values. After that, the authors find correlated pixels by computing correlation coefficients and the median of Type-one pixels. Next, secret data bits are embedded within Type-two pixels based on correlated pixels and Type-one pixels based on the stego Type-two pixels. The data extraction process successfully extracts secret data as well as recovers the cover image. The authors observed the effects of the proposed method by performing experiments on some standard cover images and found significantly better result in terms of data hiding capacity compared with existing data hiding schemes.

scholarly journals Reversible Data Hiding for Encrypted 3D Model Based on Prediction Error Expansion

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Li Li ◽  
Shengxian Wang ◽  
Ting Luo ◽  
Ching-Chun Chang ◽  
Qili Zhou ◽  
...  
Keyword(s):  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
3D Model ◽  
Data Extraction ◽  
Direction Vector ◽  
Secret Data ◽  
Model Based ◽  
Prediction Error Expansion ◽  
Error Expansion

Since 3D models can intuitively display real-world information, there are potential scenarios in many application fields, such as architectural models and medical organ models. However, a 3D model shared through the internet can be easily obtained by an unauthorized user. In order to solve the security problem of 3D model in the cloud, a reversible data hiding method for encrypted 3D model based on prediction error expansion is proposed. In this method, the original 3D model is preprocessed, and the vertex of 3D model is encrypted by using the Paillier cryptosystem. In the cloud, in order to improve accuracy of data extraction, the dyeing method is designed to classify all vertices into the embedded set and the referenced set. After that, secret data is embedded by expanding direction of prediction error with direction vector. The prediction error of the vertex in the embedded set is computed by using the referenced set, and the direction vector is obtained according to the mapping table, which is designed to map several bits to a direction vector. Secret data can be extracted by comparing the angle between the direction of prediction error and direction vector, and the original model can be restored using the referenced set. Experiment results show that compared with the existing data hiding method for encrypted 3D model, the proposed method has higher data hiding capacity, and the accuracy of data extraction have improved. Moreover, the directly decrypted model has less distortion.

Sign in / Sign up

Export Citation Format

Share Document