This paper proposes a novel reversible data hiding scheme for encrypted images by using homomorphic and probabilistic properties of Paillier cryptosystem. In the proposed method, groups of adjacent pixels are randomly selected, and reversibly embedded into the rest of the image to make room for data embedding. In each group, there are a reference pixel and a few host pixels. Least significant bits (LSBs) of the reference pixels are reset before encryption and the encrypted host pixels are replaced with the encrypted reference pixel in the same group to form mirroring ciphertext groups (MCGs). In such a way, the modification on MCGs for data embedding will not cause any pixel oversaturation in plaintext domain and the embedded data can be directly extracted from the encrypted domain. In an MCG, the reference ciphertext pixel is kept unchanged as a reference while data hider embeds the encrypted additional data into the LSBs of the host ciphertext pixels by employing homomorphic multiplication. On the receiver side, the hidden ciphertext data can be retrieved by employing a modular multiplicative inverse operation between the marked host ciphertext pixels and their corresponding reference ciphertext pixels, respectively. After that, the hidden data are extracted promptly by looking for a one-to-one mapping table from ciphertext to plaintext. Data extraction and image restoration can be accomplished without any error after decryption. Compared with the existing works, the proposed scheme has lower computation complexity, higher security performance, and better embedding performance. The experiments on the standard image files also certify the effectiveness of the proposed scheme.
12 February 2021 in IEEE Signal Processing Letters
How to predict images is an important issue in the reversible data hiding (RDH) community. In this letter, we propose a novel CNN-based prediction approach by luminously dividing a grayscale image into two sets and applying one set to predict the other set for data embedding. The proposed CNN predictor is a lightweight and computation-efficient network with the capabilities of multi receptive fields and global optimization. This CNN predictor can be trained quickly and well by using 1000 images randomly selected from ImageNet. Furthermore, we propose a two stages of embedding scheme for this predictor. Experimental results show that the CNN predictor can make full use of more surrounding pixels to promote the prediction performance. Furthermore, in the experimental way we have shown that the CNN predictor with expansion embedding and histogram shifting techniques can provide better embedding performance in comparison with those classical linear predictors.
1 January 2021 in IEEE Transactions on Image Processing
Cover-lossless robust watermarking is a new research issue in the information hiding community, which can restore the cover image completely in case of no attacks. Most countermeasures proposed in the literature usually focus on additive noise-like manipulations such as JPEG compression, low-pass filtering and Gaussian additive noise, but few are resistant to challenging geometric deformations such as rotation and scaling. The main reason is that in the existing cover-lossless robust watermarking algorithms, those exploited robust features are related to the pixel position. In this paper, we present a new cover-lossless robust image watermarking method by efficiently embedding a watermark into low-order Zernike moments and reversibly hiding the distortion due to the robust watermark as the compensation information for restoration of the cover image. The amplitude of the exploited low-order Zernike moments are: 1) mathematically invariant to scaling the size of an image and rotation with any angle; and 2) robust to interpolation errors during geometric transformations, and those common image processing operations. To reduce the compensation information, the robust watermarking process is elaborately and luminously designed by using the quantized error, the watermarked error and the rounded error to represent the difference between the original and the robust watermarked image. As a result, a cover-lossless robust watermarking system against geometric deformations is achieved with good performance. Experimental results show that the proposed robust watermarking method can effectively reduce the compensation information, and the new cover-lossless robust watermarking system provides strong robustness to those content-preserving manipulations including scaling, rotation, JPEG compression and other noise-like manipulations. In case of no attacks, the cover image can be recovered without any loss.
30 November 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
In the field of reversible data hiding (RDH), how to predict an image and embed a message into the image with smaller distortion are two important aspects. In this paper, we propose a novel and efficient RDH method by innovating an intelligent predictor and an adaptive embedding way. In the prediction stage, we first constructed a convolutional neural network (CNN) based predictor by reasonably dividing an image into four parts. In such a way, each part can be predicted by using the other three parts as the context for the improvement of the prediction performance. Compared with existing predictors, the proposed CNN predictor can use more neighboring pixels for the prediction by exploiting its multi-receptive fields and global optimization capacities. In the embedding stage, we also developed a prediction-error-ordering (PEO) based adaptive embedding strategy, which can better adapt image content and thus efficiently reduce the embedding distortion by elaborately and luminously applying background complexity to select and pair those smaller prediction errors for data hiding. With the proposed CNN prediction and embedding ways, the RDH method presented in this paper provides satisfactory results in improving the visual quality of data hidden images, e.g., the average PSNR value for the Kodak benchmark dataset can reach as high as 63.59 dB with an embedding capacity of 10,000 bits. Extensive experimental results have shown that the RDH method proposed in this paper is superior to those existing state-of-the-art works.
25 October 2022 in IEEE Transactions on Circuits and Systems for Video Technology
The robust reversible watermarking (RRW) requires high robustness and capacity on the condition of reversibility and imperceptibility, which still remains a big challenge nowadays. In this paper, we propose a two-stage RRW scheme that improves robustness and capacity through embedding optimization and rounded error compensation. The first stage inserts a robust watermark into the selected Pseudo-Zernike moments (PZMs) by using an adaptive normalization method and an optimized embedding strategy. Specifically, the adaptive normalization method achieves both an invariance to pixel amplitude variation and a balance between robustness and imperceptibility, and the optimized embedding strategy reduces embedding distortions remarkably. The watermarked PZMs are inversely transformed to generate the robustly watermarked image, in which rounded errors caused in the inverse transformation is compensated elaborately and thus a larger capacity can be obtained at the same embedding distortion. The second stage embeds a reversible watermark consisting of errors between the robust watermark embedded image and the original one, aiming at achieving the reversibility in case of no attacks. Extensive experimental simulations show that the proposed scheme provides strong robustness against common signal processing, including AWGN, salt-and-pepper noise, JPEG, JPEG2000, median filtering, mean filtering, geometrical transformations involving rotation and scaling, and a compressive sensing attack exemplified by two-dimensional compressive sensing, which outperforms the state-of-the-art schemes. Our code is available at https://github.com/yichao-tang/PZMs-RRW.
4 March 2024 in IEEE Transactions on Information Forensics and Security
For copyright protection and perfect recovery of the original image in case of no attacks, it is necessary to develop robust reversible watermarking (RRW) methods that counteract both common signal processing (CSP) and geometric deformation (GD) attacks (RRW-CG). However, to the best of our knowledge, none of the existing RRW methods exploit target attacks as prior knowledge to improve their robustness and embedding capacity. To this end, we propose a two-stage RRW-CG scheme with attack-simulation-based adaptive normalization and embedding. Specifically, the polar harmonic transform (PHT) moments are taken as watermark carriers, and their stability with respect to target attacks is evaluated by performing attack simulation tests on large-scale images. This enables the adaptive normalization of PHT moments to improve the watermark robustness. The PHT moments with high stability are then chosen as watermark carriers, and the conventional spread transform dither modulation (STDM) with one quantization level is optimized to form the enhanced version with multiple quantization levels, in which the embedding strength is determined adaptively via attack simulation tests on the candidate watermarked image. This in turn improves the watermark robustness and increases the embedding capacity. After the robust watermark has been embedded, errors caused by robust watermarking are used as the auxiliary information and then inserted into the robustly watermarked image via the recursive code-based reversible watermarking technique, ensuring the reversibility in case of no attacks. Extensive experimental simulation results show that the proposed scheme outperforms the state-of-the-art RRW methods in terms of robustness against CSP such as AWGN, JPEG, JPEG2000, mean filtering, and median filtering as well as GD including rotation and scaling under the same invisibility, reversibility, and embedding capacity. This indicates that, by exploiting target attacks as prior knowledge and designing the attack-simulation-based adaptive normalization and embedding, the proposed novel RRW is feasible and effective.