scholarly journals Separable Data-Hiding Scheme for Encrypted Image to Protect Privacy of User in Cloud

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 82 ◽  
Author(s):  
Li Liu ◽  
Lifang Wang ◽  
Yun-Qing Shi ◽  
Chin-Chen Chang

As cloud computing becomes popular, the security of users’ data is faced with a great threat, i.e., how to protect users’ privacy has become a pressing research topic. The combination of data hiding and encryption can provide dual protection for private data during cloud computing. In this paper, we propose a new separable data-hiding scheme for encrypted images based on block compressive sensing. First, the original uncompressed image is compressed and encrypted by block compressive sensing (BCS) using a measurement matrix, which is known as an encryption key. Then, some additional data can be hidden into the four least significant bits of measurement using the data-hiding key during the process of encoding. With an encrypted image that contains hidden data, the receiver can extract the hidden data or decrypt/reconstruct the protected private image, according to the key he/she possesses. This scheme has important features of flexible compression and anti-data-loss. The image reconstruction and data extraction are separate processes. Experimental results have proven the expected merits of the proposed scheme. Compared with the previous work, our proposed scheme reduces the complexity of the scheme and also achieves better performance in compression, anti-data-loss, and hiding capacity.

2021 ◽  
Vol 7 (12) ◽  
pp. 268
Author(s):  
Ryota Motomura ◽  
Shoko Imaizumi ◽  
Hitoshi Kiya

In this paper, we propose a new framework for reversible data hiding in encrypted images, where both the hiding capacity and lossless compression efficiency are flexibly controlled. There exist two main purposes; one is to provide highly efficient lossless compression under a required hiding capacity, while the other is to enable us to extract an embedded payload from a decrypted image. The proposed method can decrypt marked encrypted images without data extraction and derive marked images. An original image is arbitrarily divided into two regions. Two different methods for reversible data hiding in encrypted images (RDH-EI) are used in our method, and each one is used for either region. Consequently, one region can be decrypted without data extraction and also losslessly compressed using image coding standards even after the processing. The other region possesses a significantly high hiding rate, around 1 bpp. Experimental results show the effectiveness of the proposed method in terms of hiding capacity and lossless compression efficiency.


Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 790
Author(s):  
Lin Li ◽  
Chin-Chen Chang ◽  
Chia-Chen Lin

With the development of cloud storage and privacy protection, reversible data hiding in encrypted images (RDHEI) plays the dual role of privacy protection and secret information transmission. RDHEI has a good application prospect and practical value. The current RDHEI algorithms still have room for improvement in terms of hiding capacity, security and separability. Based on (7, 4) Hamming Code and our proposed prediction/ detection functions, this paper proposes a Hamming Code and UnitSmooth detection based RDHEI scheme, called HUD-RDHEI scheme for short. To prove our performance, two database sets—BOWS-2 and BOSSBase—have been used in the experiments, and peak signal to noise ratio (PSNR) and pure embedding rate (ER) are served as criteria to evaluate the performance on image quality and hiding capacity. Experimental results confirm that the average pure ER with our proposed scheme is up to 2.556 bpp and 2.530 bpp under BOSSBase and BOWS-2, respectively. At the same time, security and separability is guaranteed. Moreover, there are no incorrect extracted bits during data extraction phase and the visual quality of directly decrypted image is exactly the same as the cover image.


2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Dawen Xu ◽  
Shubing Su

In this paper, an efficient reversible data hiding method for encrypted image based on neighborhood prediction is proposed, which includes image encryption, reversible data hiding in encrypted domain, and hidden data extraction. The cover image is first partitioned into non-overlapping blocks, and then the pixel value in each block is encrypted by modulo operation. Therefore, the linear prediction difference in the block that satisfies the specific condition is consistent before and after encryption, ensuring that data extraction is completely separable from image decryption. In addition, by using the linear weighting of three adjacent pixels in the block to predict the current pixel, the prediction accuracy can be improved. The data-hider, who does not know the original image content, may embed additional data based on prediction difference histogram modification. Data extraction and image recovery are free of any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Xi-Yan Li ◽  
Xia-Bing Zhou ◽  
Qing-Lei Zhou ◽  
Shi-Jing Han ◽  
Zheng Liu

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.


While Internet of Things (IoT) technology comprises of nodes that are self-configuring and intelligent which are interconnected in a dynamic network, utilization of shared resources has been revolutionized by the cloud computing effectively reducing the cost overheadamong the cloud users.The major concerns of IoT infrastructure are reliability, performance, security and privacy. Cloud computing is popular for its unlimited storage and processing power. Cloud computing is much more matured with the capability to resolve most of the issues in IoT technology. A suitable way to address most of the issues in IoT technology is by integrating IoTparadigm into the Cloud technology.In this regard, we propose a methodology of applying our EPAS scheme for IoT applications. In our previous work[2] , we have proposed an Enhanced Privacy preserving gene based data Aggregation Scheme (EPAS) for private data transmission and storage by utilizing Enhanced P-Gene erasable data hiding approach. Enhanced P-Gene scheme ensures secure transmission and storage of private data by relying on a data aggregation scheme fully dependent on erasable data hiding technique. In the current work we analyse the applicability of the EPAS scheme for IoT applications. Experimental results show the suitability of the proposed scheme for application involving numeric data and also demonstrates performance improvement with existing proposals for data aggregation in cloud.


2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Chunqiang Yu ◽  
Xianquan Zhang ◽  
Zhenjun Tang ◽  
Yan Chen ◽  
Jingyu Huang

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shun Zhang ◽  
Tiegang Gao ◽  
Guorui Sheng

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.


2014 ◽  
Vol 50 (8) ◽  
pp. 598-600 ◽  
Author(s):  
Di Xiao ◽  
Shoukuo Chen

Sign in / Sign up

Export Citation Format

Share Document