This paper proposes a new separable reversible data hiding method for encrypted images. Proposed scheme employs the pixel redundancy of natural images to construct embedding space. First, cover image is divided into multiple blocks with different scales. According to the pixel average value of each block, the lowest two bits of every pixel are vacated as reserved rooms. Subsequently, the whole image is encrypted by using stream cipher and the secret messages are finally embedded into the reserved rooms by the embedding key. Proposed scheme is separable in the sense that the recipient can achieve different function by the following ways: (a) If the recipient has only decryption key, an approximation plaintext image containing the embedded information can be obtained. (b) If the recipient has only embedded key, secret messages can be extracted correctly. (c) If the recipient has both decryption key and embedded key, he can not only extract the secret messages, but recover the original cover image perfectly. Extensive experiments are performed to show that our proposed schemes outperform existing reversible data hiding schemes in terms of visual quality, embedding capacity and security performance, even if a large-scale image database is used.
相似文献To better protect the security of users’ private data in the cloud environment, the technology for separable reversible data hiding in encrypted images has been attracting increasing attention from researchers. In this paper, we propose a separable reversible data hiding scheme in encrypted images based on the flexible preservation of differences. This scheme has three parts: 1) For the content owner, the original image is divided into non-overlapping blocks, for which block-mean is computed. Then the differences between the values of every pixel and the block-mean are obtained and an initial label map is generated. Because most of the differences tend to concentrate around 0, we use two bits to dynamically record the range of the differences to vacate space for hiding. Further, introducing the block-mean differences also serves to vacate more space, for which the label map is amended accordingly. Finally, the image with free space is encrypted into the encrypted image using an encryption key. 2) For the data hider, the secret bits are embedded into the encrypted image by directly replacing the spare bits without obtaining any information of the original image. 3) For the receiver, he/she can achieve the desired information according to the key in his/her possession. Experimental results show that our proposed scheme is able to achieve an average embedding capacity as large as 1.785 bpp and 1.709 bpp when block size is set to 2?×?2 and 2?×?4, respectively. Comparison with those of previous schemes, the proposed scheme has excellent embedding capacity, especially for smoother images.
相似文献A visually secure multiple image encryption using chaotic map and compressive sensing is proposed. The existing image encryption algorithms transform a secret image into a random noise like cipher image which can lead to cryptanalysis by an intruder. In the proposed method, compressive sampling is done using a chaos based, key controlled measurement matrix. An image dependent key generation scheme is used to generate the parameters of the chaotic map. The secret images are transformed into wavelet coefficients, and scrambled along a zigzag path, so that the high correlation among them can be reduced and thereby provide increased security level. The sparse coefficients are measured using the chaotic map-based measurement matrix, whose initial parameters are obtained from the keys generated. Then the reduced measurements are embedded into the sub-bands of the wavelet transformed cover image. Therefore, the proposed algorithm is highly sensitive to the secret images and can effectively withstand known-plaintext and chosen-plaintext attacks. Additionally, the cipher image and the secret images are of same size and do not require additional transmission bandwidth and storage space.
相似文献Existing prediction-based works on reversible data hiding in encrypted images usually embed the secret messages by referring to the difference between current pixel and its predicted value. An accurate prediction model may promote an improvement of embedding capacity. Existing schemes, however, may not work well due to involving a bad prediction model so that their embedding capacity cannot be improved further. To address the problem, this paper proposes a new reversible data hiding scheme in encrypted images by designing double linear regression prediction model. Proposed model can significantly improve the prediction accuracy of current pixel based on neighboring pixels, more auxiliary rooms are thus vacated to embed secret data. Furthermore, a prediction error map is constructed to mark the error positions caused by inaccurate prediction, which can be further compressed lossless to lower the capacity of auxiliary data. Reversible recovery for original image can be finally achieved successfully. Experimental results demonstrate that the proposed scheme significantly improves prediction accuracy and data embedding capacity by combining double linear regression prediction model and prediction error map, and then can achieve separable and lossless recovery for the original image. Compared with existing works, the proposed scheme can implement a higher visual quality of decrypted images, while maintaining a larger embedding capacity.
相似文献