scholarly journals Separable and Error-Free Reversible Data Hiding in Encrypted Image with High Payload

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Zhaoxia Yin ◽  
Bin Luo ◽  
Wien Hong
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Data Extraction ◽  
Receiver Side ◽  
Histogram Shifting ◽  
Encrypted Image ◽  
Free Data ◽  
Peak Points ◽  
High Payload

This paper proposes a separable reversible data-hiding scheme in encrypted image which offers high payload and error-free data extraction. The cover image is partitioned into nonoverlapping blocks and multigranularity encryption is applied to obtain the encrypted image. The data hider preprocesses the encrypted image and randomly selects two basic pixels in each block to estimate the block smoothness and indicate peak points. Additional data are embedded into blocks in the sorted order of block smoothness by using local histogram shifting under the guidance of the peak points. At the receiver side, image decryption and data extraction are separable and can be free to choose. Compared to previous approaches, the proposed method is simpler in calculation while offering better performance: larger payload, better embedding quality, and error-free data extraction, as well as image recovery.

scholarly journals Separable Reversible Data Hiding in Encrypted Image Based on Two-Dimensional Permutation and Exploiting Modification Direction

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 976
Author(s):  
Chunqiang Yu ◽  
Chenmei Ye ◽  
Xianquan Zhang ◽  
Zhenjun Tang ◽  
Shanhua Zhan
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
State Of The Art ◽  
Data Extraction ◽  
Visual Quality ◽  
Two Dimensional ◽  
Original Image ◽  
Encrypted Image ◽  
Peak Points ◽  
Exploiting Modification Direction

In this paper, we propose a separable reversible data hiding method in encrypted image (RDHEI) based on two-dimensional permutation and exploiting modification direction (EMD). The content owner uses two-dimensional permutation to encrypt original image through encryption key, which provides confidentiality for the original image. Then the data hider divides the encrypted image into a series of non-overlapping blocks and constructs histogram of adjacent encrypted pixel errors. Secret bits are embedded into a series of peak points of the histogram through EMD. Direct decryption, data extraction and image recovery can be performed separately by the receiver according to the availability of encryption key and data-hiding key. Different from some state-of-the-art RDHEI methods, visual quality of the directly decrypted image can be further improved by the receiver holding the encryption key. Experimental results demonstrate that the proposed method outperforms some state-of-the-art methods in embedding capacity and visual quality.

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 for Encrypted Image Based on Arnold Transformation

2018 ◽  
Vol 173 ◽  
pp. 03088
Author(s):  
Dan Wu
Keyword(s):  
Data Hiding ◽  
Information Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Original Image ◽  
Good Image Quality ◽  
Encrypted Image ◽  
Secret Keys ◽  
The Difference ◽  
Arnold Transformation

A reversible data hiding scheme for encrypted image was proposed based on Arnold transformation. In this scheme, the original image was divided into four sub-images by sampling, the sub-images were scrambled by Arnold transformation using two secret keys, then the scrambled sub-images were reconstituted an encrypted image. Subsequently, additional data was embedded into the encrypted image by modifying the difference between two adjacent pixels. With an encrypted image containing additional data, the receiver can obtain a decrypt image using the decryption key. Meanwhile, with the aid of the decryption key and information hiding key, the receiver can pick the hiding information and recover the original image without any error. Experiment result shows that the proposed scheme can obtain a higher payload with good image quality.

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

Electronics ◽  
2021 ◽  
Vol 10 (6) ◽  
pp. 664
Author(s):  
Ya Liu ◽  
Guangdong Feng ◽  
Chuan Qin ◽  
Haining Lu ◽  
Chin-Chen Chang
Keyword(s):  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Cloud Storage ◽  
Additional Data ◽  
State Of The Art ◽  
Data Extraction ◽  
High Capacity ◽  
Quad Tree ◽  
Encrypted Images

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.

scholarly journals Implementation of Detachable Reversible Data Hiding in Image Encryption

2013 ◽  
Vol 11 (6) ◽  
pp. 2663-2667
Author(s):  
Musham Pradeep ◽  
D Srilatha
Keyword(s):  
Image Encryption ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Original Image ◽  
Encrypted Image

This paper proposes a scheme for detachable reversible data hiding in image encryption. In which the sender encrypts an image using encryption key. Then, the data is appended to the encrypted image using a data-hiding key. With an encrypted image containing additional data, if a receiver has the data-hiding key, he can extract the additional data though he does not know the content of the image. If the receiver has the encryption key, he can decrypt the encrypted image and get an image similar to the original one, but he cannot extract the additional data. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original image without any error.

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

2017 ◽  
Vol 26 (06) ◽  
pp. 1750103 ◽  
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.

scholarly journals Reversible Data Hiding Scheme in Homomorphic Encrypted Image Based on EC-EG

2019 ◽  
Vol 9 (14) ◽  
pp. 2910 ◽  
Author(s):  
Neng Zhou ◽  
Minqing Zhang ◽  
Han Wang ◽  
Mengmeng Liu ◽  
Yan Ke ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Cover Image ◽  
Public Key Encryption ◽  
Encrypted Image ◽  
Predictive Error ◽  
Reference Pixel ◽  
Embedding Rate

To combine homomorphic public key encryption with reversible data hiding, a reversible data hiding scheme in homomorphic encrypted image based on EC-EG is proposed. Firstly, the cover image is segmented. The square grid pixel group randomly selected by the image owner has one reference pixel and eight target pixels. The n least significant bits (LSBs) of the reference pixel and all bits of target pixel are self-embedded into other parts of the image by a method of predictive error expansion (PEE). To avoid overflowing when embedding data, the n LSBs of the reference pixel are reset to zero before encryption. Then, the pixel values of the image are encrypted after being encoded onto the points of the elliptic curve. The encrypted reference pixel replaces the encrypted target pixels surrounding it, thereby constructing the mirroring central ciphertext (MCC). In a set of MCC, the data hider embeds the encrypted additional data into the n LSBs of the target pixels by homomorphic addition in ciphertexts, while the reference pixel remains unchanged. The receiver can directly extract additional data by homomorphic subtraction in ciphertexts between the target pixels and the corresponding reference pixel; extract the additional data by subtraction in plaintexts with the directly decrypted image; and restore the cover image without loss. The experimental results show that the proposed scheme has higher security than the similar algorithms, and the average embedding rate of the scheme is 0.25 bpp under the premise of ensuring the quality of the directly decrypted image.

scholarly journals Reversible Data Hiding Algorithm in Fully Homomorphic Encrypted Domain

Entropy ◽  
2019 ◽  
Vol 21 (7) ◽  
pp. 625 ◽  
Author(s):  
Jingxuan Li ◽  
Xingyuan Liang ◽  
Ceyu Dai ◽  
Shijun Xiang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Homomorphic Encryption ◽  
Modular Arithmetic ◽  
Original Image ◽  
Encrypted Image ◽  
Group A ◽  
The Difference ◽  
Difference Histogram

This paper proposes a reversible data hiding scheme by exploiting the DGHV fully homomorphic encryption, and analyzes the feasibility of the scheme for data hiding from the perspective of information entropy. In the proposed algorithm, additional data can be embedded directly into a DGHV fully homomorphic encrypted image without any preprocessing. On the sending side, by using two encrypted pixels as a group, a data hider can get the difference of two pixels in a group. Additional data can be embedded into the encrypted image by shifting the histogram of the differences with the fully homomorphic property. On the receiver side, a legal user can extract the additional data by getting the difference histogram, and the original image can be restored by using modular arithmetic. Besides, the additional data can be extracted after decryption while the original image can be restored. Compared with the previous two typical algorithms, the proposed scheme can effectively avoid preprocessing operations before encryption and can successfully embed and extract additional data in the encrypted domain. The extensive testing results on the standard images have certified the effectiveness of the proposed scheme.

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.

Sign in / Sign up

Export Citation Format

Share Document