Reversible data hiding in encrypted images (RDHEI) is an effective technique of data security. Most state-of-the-art RDHEI methods do not achieve desirable payload yet. To address this problem, we propose a new RDHEI method with hierarchical embedding. Our contributions are twofold. (1) A novel technique of hierarchical label map generation is proposed for the bit-planes of plaintext image. The hierarchical label map is calculated by using prediction technique, and it is compressed and embedded into the encrypted image. (2) Hierarchical embedding is designed to achieve a high embedding payload. This embedding technique hierarchically divides prediction errors into three kinds: small-magnitude, medium-magnitude, and large-magnitude, which are marked by different labels. Different from the conventional techniques, pixels with small-magnitude/large-magnitude prediction errors are both used to accommodate secret bits in the hierarchical embedding technique, and therefore contribute a high embedding payload. Experiments on two standard datasets are discussed to validate the proposed RDHEI method. The results demonstrate that the proposed RDHEI method outperforms some state-of-the-art RDHEI methods in payload. The average payloads of the proposed RDHEI method are 3.4568 bpp and 3.6823 bpp for BOWS-2 dataset and BOSSbase dataset, respectively.
27 April 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Reversible data hiding in encrypted images (RDHEI) is an essential data security technique. Most RDHEI methods cannot perform well in embedding capacity and security. To address this issue, we propose a new RDHEI method using Chinese remainder theorem-based secret sharing (CRTSS) and hybrid coding. Specifically, a hybrid coding is first proposed for RDH to achieve high embedding capacity. At the content owner side, a novel iterative encryption is designed to conduct block based encryption for perfectly preserving the spatial correlation of original blocks in their encrypted blocks. Then, the CRTSS with the constraints is exploited to generate multiple encrypted image shares, in which spatial correlations of the encrypted blocks are also preserved. Meanwhile, the CRTSS provides good security properties for the proposed method. Since there are strong spatial correlations in the blocks of each share, the data-hider can exploit the proposed hybrid coding to perform data embedding for improving capacity. On the receiver side, even if some shares are corrupted/missing, the original image can be losslessly recovered as long as enough uncorrupted marked shares are obtained. Experiment results show that the proposed RDHEI method outperforms some state-of-the-art methods, including some secret sharing (SS) based methods in terms of embedding capacity.
15 January 2019 in Security and Communication Networks
Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.
Reversible data hiding (RDH) in color image is an important topic of data hiding. This paper presents an efficient RDH algorithm for color image via double-layer embedding. The key contribution is the proposed double-layer embedding technique based on histogram shifting (HS). This technique exploits image interpolation to generate prediction error matrices for HS in the first-layer embedding and uses local pixel similarity to calculate difference matrices for HS in the second-layer embedding. It inherits reversibility from HS and makes high embedding capacity due to the use of double layers in data embedding. In addition, inter-channel correlation is incorporated into the first-layer embedding and the second-layer embedding for generating histograms with high peaks, so as to improve embedding capacity. Experiments with open standard datasets are done to validate performance of the proposed RDH algorithm. Comparison results show that the proposed RDH algorithm outperforms some state-of-the-art RDH algorithms in terms of embedding capacity and visual quality.
Reversible data hiding in encrypted images (RDHEI) is an effective technology of protecting private data. In this paper, a high-capacity RDHEI method with asymmetric coding and bit-plane block compression is proposed. Our major contributions are twofold. (1) We propose an asymmetric coding technique for processing prediction error (PE) blocks before encryption. The proposed asymmetric coding technique does not generate the sign bit-plane and facilitates massive 0s converging on the high bit-planes. This is beneficial to reserve the embedding room. (2) We present a bit-plane block compression technique for improving the embedding capacity. This technique divides the PE codes in a block into two parts which are both compressed and thus contribute a large embedding room. Experimental results demonstrate that the average embedding rates of the proposed method are 4.156, 4.063 and 3.450 bpp on the BOSSBase, BOWS-2 and UCID datasets, respectively. Comparisons show that our average embedding rates on the three datasets are all bigger than those of some state-of-the-art methods.
Reversible data hiding is an important topic of data hiding. This paper proposes a novel separable and error-free reversible data hiding in an encrypted image based on two-layer pixel errors. Specifically, the proposed scheme divides the original image into a series of non-overlapped blocks and permutes these blocks. Then, a closed Hilbert curve is used for scanning each block to obtain a one-dimensional pixel sequence. The pixels of the sequence are encrypted with key transmission. During data hiding, each non-overlapped block of the encrypted image is scanned in the closed Hilbert order to generate a one-dimensional encrypted pixel sequence. Finally, it exploits the histogram of two-layer adjacent encrypted pixel errors to embed secret data by histogram shifting and generate a marked encrypted image. Many experiments are carried out, and the results demonstrate that the proposed scheme reaches a high payload and outperforms some reversible data hiding schemes in the encrypted image.