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 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.

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 Efficient Lossless Compression Based Reversible Data Hiding Using Multilayered n-Bit Localization

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Rashid Abbasi ◽  
Lixiang Xu ◽  
Farhan Amin ◽  
Bin Luo
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Lossless Compression ◽  
Cover Image ◽  
Optimum Level ◽  
Embedding Capacity ◽  
Peak Point ◽  
Lower Block ◽  
Block Level

We proposed an innovative reversible data hiding technique that is formulated on histogram shifting by using multilayer localized n-bit truncation image (LBPTI), namely, generated form 8-bit plane by means of efficient lossless compression. After selecting the reference point from the block, the neighbor topmost points are used to attain the data embedding without modifying the peak point; in addition, the key information regarding peak point is not mandatory in extraction end to extract the secret information. In order to make the embedded cover-image similar to the histogram of original cover-image, we exploited the localization with efficient lossless compression on lower block level to increase the embedding capacity while controlling extra bit to expand additional embedding capacity on optimum level besides sustaining the quality of cover-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.

High-Capacity Reversible Data Hiding Using Modified Pixel Value Ordering Approach

2018 ◽  
Vol 27 (11) ◽  
pp. 1850175 ◽  
Author(s):  
Neeraj Kumar Jain ◽  
Singara Singh Kasana
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Visual Quality ◽  
Experimental Results ◽  
Cover Image ◽  
Embedding Capacity ◽  
Signal Process ◽  
Pixel Value

The proposed reversible data hiding technique is the extension of Peng et al.’s technique [F. Peng, X. Li and B. Yang, Improved PVO-based reversible data hiding, Digit. Signal Process. 25 (2014) 255–265]. In this technique, a cover image is segmented into nonoverlapping blocks of equal size. Each block is sorted in ascending order and then differences are calculated on the basis of locations of its largest and second largest pixel values. Negative predicted differences are utilized to create empty spaces which further enhance the embedding capacity of the proposed technique. Also, the already sorted blocks are used to enhance the visual quality of marked images as pixels of these blocks are more correlated than the unsorted pixels of the block. Experimental results show the effectiveness of the proposed technique.

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 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 Improved Encrypted-Signals-Based Reversible Data Hiding Using Code Division Multiplexing and Value Expansion

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Xianyi Chen ◽  
Haidong Zhong ◽  
Lizhi Xiong ◽  
Zhihua Xia
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Signal Energy ◽  
Spreading Sequence ◽  
Capacity Data ◽  
Embedding Rate ◽  
Better Than ◽  
Code Division Multiplexing

Compared to the encrypted-image-based reversible data hiding (EIRDH) method, the encrypted-signals-based reversible data hiding (ESRDH) technique is a novel way to achieve a greater embedding rate and better quality of the decrypted signals. Motivated by ESRDH using signal energy transfer, we propose an improved ESRDH method using code division multiplexing and value expansion. At the beginning, each pixel of the original image is divided into several parts containing a little signal and multiple equal signals. Next, all signals are encrypted by Paillier encryption. And then a large number of secret bits are embedded into the encrypted signals using code division multiplexing and value expansion. Since the sum of elements in any spreading sequence is equal to 0, lossless quality of directly decrypted signals can be achieved using code division multiplexing on the encrypted equal signals. Although the visual quality is reduced, high-capacity data hiding can be accomplished by conducting value expansion on the encrypted little signal. The experimental results show that our method is better than other methods in terms of the embedding rate and average PSNR.

Sign in / Sign up

Export Citation Format

Share Document