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

 

Abstract

 

This paper first introduces a parametric binary tree labeling scheme (PBTL) to label image pixels in two different categories. Using PBTL, a data embedding method (PBTL-DE) is proposed to embed secret data to an image by exploiting spatial redundancy within small image blocks. We then apply PBTL-DE into the encrypted domain and propose a PBTLbased reversible data hiding method in encrypted images (PBTLRDHEI). PBTL-RDHEI is a eparable and reversible method that both the original image and secret data can be recovered and extracted losslessly and independently. Experiment results and analysis show that PBTL-RDHEI is able to achieve an average embedding rate as large as 1.752 bpp and 2.003 bpp when block size is set to 2 _ 2 and 3 _ 3, respectively

 

Existing System

 

Existing RDHEI methods can be classified into three categories, namely reserving room before encryption (RRBE)  reserving room after encryption (RRAE) and vacating room by encryption (VRBE. The RRBE methods use some traditional RDH methods or exploit spatial redundancy from the original image to reserve spare room before image encryption. The second category mainly uses the standard image encryption algorithms such as AES, RC4 or homomorphic encryption to encrypt the original image directly. The VRBE methods adopt some specific encryption algorithm to encrypt the original image while keeping spatial redundancy in the encrypted image so that it can be exploited for data embedding. Ma et al. first proposed a RRBE method. They divide the original image into smooth area and coarse area, and embed several least significant bit (LSB) planes of the coarse area into the smooth area using the traditional RDH method [6]. The reserved LSB planes are then used for data embedding. Mathew et al.

 

 

 

Proposed System

 

We propose a parametric binary tree labeling scheme (PBTL) to label pixels in two different categories. Selecting different settings of parameters, PBTL will provide different pixel labeling strategies. Using PBTL, we propose a data embedding algorithm (PBTL-DE). It exploits spatial redundancy in small image blocks and embeds secret data into cover images using pixel labeling and bit replacement. Different from the traditional data embedding methods that embed secret data by modifying the plaintext cover image pixel values in an imperceptive way, PBTL-DE is designed for encrypted images. Thus, the significant changes to pixel values are acceptable. Based on PBTL-DE algorithm, we further propose a PBTL-based RDHEI method (PBTL-RDHEI). Simulation results of applying PBTL-RDHEI to 1000 randomly selected test images demonstrate that PBTL-RDHEI is able to achieve an average embedding rate as large as 1.752 bpp and 2.003 bpp when block size is set to 2_2 and 3 _ 3, respectively.

 

 

CONCLUSION

 

In this paper, we first proposed a parametric binary tree labeling scheme (PBTL). Using PBTL, we then proposed a data embedding method (PBTL-DE) and further applied it into the encrypted images  application (PBTL-RDHEI). The PBTL-DE is specific designed for encrypted-domain based application, because it significantly changed the pixel values in the image. PBTL-RDHEI is a full reversible method that both the secret data and original image can be extracted without any error. Experiment results and comparisons have shown that the PBTL-RDHEI significantly improved the embedding rate. Security analysis has demonstrated the robustness of PBTLRDHEI in withstanding brute-force and know/chosen-plaintext attacks.

 

REFERENCES

 

[1] Y. Q. Shi, X. Li, X. Zhang, H. Wu, and M. B., “Reversible data hiding: Advance in the past two decades,” IEEE Access, vol. PP, no. 99, pp. 1–1, 2016.

[2] Z. Hua, Y. Zhou, C.-M. Pun, and C. L. P. Chen, “2D Sine Logistic modulation map for image encryption,” Information Sciences, vol. 297,no. 0, pp. 80–94, 2015.

[3] X. Zhang, “Reversible data hiding with optimal value transfer,” IEEE Transactions on Multimedia, vol. 15, no. 2, pp. 316–325, 2013.

[4] J. Fridrich, M. Goljan, and R. Du, “Lossless data embedding: New paradigm in digital watermarking,” EURASIP J. Appl. Signal Process.,vol. 2002, no. 1, pp. 185–196, 2002.

[5] M. U. Celik, G. Sharma, A. M. Tekalp, and E. Saber, “Lossless generalized-LSB data embedding,” IEEE Transactions on Image Processing,vol. 14, no. 2, pp. 253–266, 2005.

[6] Z. Ni, Y.-Q. Shi, N. Ansari, and W. Su, “Reversible data hiding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 16, no. 3, pp. 354–362, 2006.

[7] A. M. Alattar, “Reversible watermark using the difference expansion of a generalized integer transform,” IEEE Transactions on Image Processing,vol. 13, no. 8, pp. 1147–1156, 2004.

[8] Y. Hu, H.-K. Lee, and J. Li, “DE-based reversible data hiding with improved overflow location map,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 19, no. 2, pp. 250–260, 2009.

[9] J. Zhou, W. Sun, L. , X. Liu, O. C. Au, and Y. Y. Tang, “Secure reversible image data hiding over encrypted domain via key modulation,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 26, no. 3, pp. 441–452, 2016.

[10] Z. Qian, X. Zhang, and S. Wang, “Reversible data hiding in encrypted JPEG bitstream,” IEEE Transactions on Multimedia, vol. 16, no. 5, pp.1486–1491, 2014.

[11] K. Ma, W. Zhang, X. Zhao, N. Yu, and F. Li, “Reversible data hiding in encrypted images by reserving room before encryption,” IEEETransactions on Information Forensics and Security, vol. 8, no. 3, pp.553–562, 2013

[12] S. Yi and Y. Zhou, “Binary-block embedding for reversible data hiding in encrypted images,” Signal Processing, vol. 133, pp. 40–51, 2017.

[13] X. Liao, K. Li, and J. Yin, “Separable data hiding in encrypted image based on compressive sensing and discrete fourier transform,”Multimedia Tools and Applications, vol. 76, no. 20, pp. 20 739–20 753,2017.

[14] X. Liao and C. Shu, “Reversible data hiding in encrypted images based on absolute mean difference of multiple neighboring pixels,” Journal of Visual Communication and Image Representation, vol. 28, no. 0, pp. 21–27, 2015.

[15] M. Li, D. Xiao, Y. Zhang, and H. Nan, “Reversible data hiding in encrypted images using cross division and additive homomorphism,”Signal Processing: Image Communication, vol. 39, no. Part A, pp. 234–248, 2015.

[16] X. Zhang, “Reversible data hiding in encrypted image,” IEEE Signal Processing Letters, vol. 18, no. 4, pp. 255–258, 2011.

[17] W. Zhang, K. Ma, and N. Yu, “Reversibility improved data hiding in encrypted images,” Signal Processing, vol. 94, no. 0, pp. 118–127, 2014.

[18] X. Cao, L. Du, X. Wei, D. Meng, and X. Guo, “High capacity reversible data hiding in encrypted images by patch-level sparse representation,”IEEE Transactions on Cybernetics, vol. 46, no. 5, pp. 1132–1143, 2016.

[19] S. Yi and Y. Zhou, “An improved reversible data hiding in encrypted images,” 2015 IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP), pp. 225–229, 2015.

[20] T. Mathew and M. Wilscy, “Reversible data hiding in encrypted images by active block exchange and room reservation,” in 2014 International Conference on Contemporary Computing and Informatics (IC3I), pp. 839–844.