Separable and Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

An Improved Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

“…In this paper, we propose an efficient method of reversible data hiding in encrypted images using parametric binary tree labeling, which is an improved method based on Yi et al's works [18]. A higher embedding rate can be achieved and during the decoding phase, the secret information must be extracted without error using data-hiding key and the original content of the image must be restored losslessly using the encryption key.…”

“…In order to achieve a better performance, we set the length of fixed-length codewords to 3 and block size to 4 × 4 in [21]. In [18] the block size is set to 3 × 3, α and β are also set to 5 and 2. Fig.…”

“…And then at the receiver end, according to different permissions, one can obtain the original image, secret information or both. Compared with Yi et al's method [18], the proposed IPBTL-RDHEI method take full advantage of the redundancy of image so that the embedding rate can be increased.…”

Separable Reversible Data Hiding in Encrypted Images Based on Difference Histogram Modification

“…Generally, existing RDH-EI methods can be classified into three categories, namely, methods by vacating room after encryption (VRAE) [12][13][14][15][16][17][18][19][20][21][22], methods by reserving room before encryption (RRBE) [23][24][25], and methods based on homomorphic encryption [26][27][28][29][30][31][32][33]. The early VRAE framework is proposed by Zhang [12,13] and Hong et al [14].…”

“…Recently, a high capacity reversible data hiding approach based on MSB (most significant bit) prediction is presented in [19]. In addition, several other VRAE schemes are reported in [20][21][22].…”