scholarly journals A Joint Encryption and Reversible Data Hiding Scheme Based on Integer-DWT and Arnold Map Permutation

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shun Zhang ◽  
Tiegang Gao ◽  
Guorui Sheng
Keyword(s):  
Frequency Domain ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Cover Image ◽  
Discrete Wavelet ◽  
Original Image ◽  
Histogram Modification ◽  
Encrypted Image ◽  
Hidden Data ◽  
Arnold Map

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.

Robust Reversible Data Hiding Scheme Based on Gravity Center Difference

2014 ◽  
Vol 6 (4) ◽  
pp. 14-33
Author(s):  
Qunting Yang ◽  
Tiegang Gao
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Low Frequency ◽  
Discrete Wavelet ◽  
Wavelet Domain ◽  
Original Image ◽  
Secret Data ◽  
Stego Image ◽  
Gravity Center ◽  
Hidden Data

This paper presents a robust reversible data hiding scheme in wavelet domain. The proposed scheme divides the permuted image into non-overlapping blocks and then gets sub-blocks. The generated sub-blocks are transformed by discrete wavelet transform and the corresponding low frequency regions are gotten, respectively. The gravity centers of low frequency regions in every non-overlapping block are very similar. These gravity center pairs are utilized to embed secret data since the insensitivity of the gravity centers to malicious tampering. Experimental results show that the original image can be recovered without any distortion after the hidden data have been extracted if the stego image has not been altered. Meanwhile hidden data can still be extracted without error when the image is compressed by JPEG and JPEG2000 to a certain extent. Compared with some existing literatures, the security, payload and robustness of the proposed scheme are significantly improved.

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.

A High Capacity Reversible Data Hiding Scheme Based on Multi-Level Integer DWT and Histogram Modification

2014 ◽  
Vol 6 (1) ◽  
pp. 51-64 ◽  
Author(s):  
Shun Zhang ◽  
Tie-gang Gao ◽  
Fu-sheng Yang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Wavelet Transformation ◽  
High Capacity ◽  
Discrete Wavelet ◽  
Embedding Capacity ◽  
Discrete Cosine Transformation ◽  
Histogram Modification ◽  
Multi Level ◽  
High Embedding Capacity

A reversible data hiding scheme based on integer DWT and histogram modification is proposed. In the scheme, the cover media is firstly transformed by Integer DWT (Discrete Wavelet Transformation); then information is embedded through the modification of histograms of the middle and high frequency sub-bands of the DWT coefficients. In order to increase the embedding capacity, a multi-level scheme is proposed, which achieved both high embedding capacity and reversibility. Extensive experimental results have shown that the proposed scheme achieves both higher embedding capacity and lower distortion than spatial domain histogram modification based schemes; and it achieved better performance than integer DCT (Discrete Cosine Transformation) based histogram modification scheme.

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.

An Efficient Reversible Data Hiding Scheme for Encrypted Images

2018 ◽  
Vol 10 (2) ◽  
pp. 1-22 ◽  
Author(s):  
Kai Chen ◽  
Dawen Xu
Keyword(s):  
Data Hiding ◽  
Efficient Method ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Emerging Technology ◽  
Experimental Results ◽  
Cover Image ◽  
Original Image ◽  
Secret Data ◽  
Encrypted Images

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.

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.

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 An Efficient Separable Reversible Data Hiding Using Paillier Cryptosystem for Preserving Privacy in Cloud Domain

Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 682 ◽  
Author(s):  
Ahmad Neyaz Khan ◽  
Ming Yu Fan ◽  
Muhammad Irshad Nazeer ◽  
Raheel Ahmed Memon ◽  
Asad Malik ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Complete Recovery ◽  
Original Image ◽  
Resource Constrained ◽  
Encrypted Image ◽  
Processing Step ◽  
Resource Constrained Devices ◽  
Constrained Devices

Reversible data hiding in encrypted image (RDHEI) is advantageous to scenarios where complete recovery of the original cover image and additional data are required. In some of the existing RDHEI schemes, the image pre-processing step involved is an overhead for the resource-constrained devices on the sender’s side. In this paper, an efficient separable reversible data hiding scheme over a homomorphically encrypted image that assures privacy preservation of the contents in the cloud environment is proposed. This proposed scheme comprises three stakeholders: content-owner, data hider, and receiver. Initially, the content-owner encrypts the original image and sends the encrypted image to the data hider. The data hider embeds the encrypted additional data into the encrypted image and then sends the marked encrypted image to the receiver. On the receiver’s side, both additional data and the original image are extracted in a separable manner, i.e., additional data and the original image are extracted independently and completely from the marked encrypted image. The present scheme uses public key cryptography and facilitates the encryption of the original image on the content-owner side, without any pre-processing step involved. In addition, our experiment used distinct images to demonstrate the image-independency and the obtained results show high embedding rate where the peak signal noise ratio (PSNR) is +∞ dB for the directly decrypted image. Finally, a comparison is drawn, which shows that the proposed scheme is an optimized approach for resource-constrained devices as it omits the image pre-processing step.

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.

Sign in / Sign up

Export Citation Format

Share Document