Separable Reversible Data Hiding in Encrypted Image with Classification Permutation

Yin, Bangxu; Chen, Fan; He, Hongjie; Yan, Shen

doi:10.1109/bigmm.2017.48

Cited by 5 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the analysis of available RDHEI literature, the RDHEI techniques can be classified into three major categories, namely, vacating room after encryption (VRAE) [12,15,21,22], vacating room by encryption (VRBE) [32,34,35], and reserving room before encryption (RRBE) [23,[29][30][31]33]. The VRAE techniques create vacancies for secret data hiding in encrypted data whereas techniques that fall into the VRBE category create vacancies for secret data hiding during encryption.…”

Section: Introductionmentioning

confidence: 99%

“…TheseRDHEI techniques are known as non-separable techniques. In [19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35], another variant of RDHEI techniques, i.e., separable RDHEI techniques, was introduced to overcome the limitation of non-separability. These techniques allow separate restoration of subscriber data and extraction of auxiliary information from the marked encrypted information.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Intra-Block Correlation Based Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

Kumar

et al. 2021

Symmetry

View full text Add to dashboard Cite

In this paper, a high capacity reversible data hiding technique using a parametric binary tree labeling scheme is proposed. The proposed parametric binary tree labeling scheme is used to label a plaintext image’s pixels as two different categories, regular pixels and irregular pixels, through a symmetric or asymmetric process. Regular pixels are only utilized for secret payload embedding whereas irregular pixels are not utilized. The proposed technique efficiently exploits intra-block correlation, based on the prediction mean of the block by symmetry or asymmetry. Further, the proposed method utilizes blocks that are selected for their pixel correlation rather than exploiting all the blocks for secret payload embedding. In addition, the proposed scheme enhances the encryption performance by employing standard encryption techniques, unlike other block based reversible data hiding in encrypted images. Experimental results show that the proposed technique maximizes the embedding rate in comparison to state-of-the-art reversible data hiding in encrypted images, while preserving privacy of the original contents.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Intra-Block Correlation Based Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

Kumar

et al. 2021

Symmetry

View full text Add to dashboard Cite

show abstract

“…Wu (2017) did not confine gray-scale images, but proposed a new RDH scheme for encrypted color images. In order to improve the security and quality of decrypted and restored images, a separable reversible data hiding method for encrypted images based on classified arrangement was proposed (Yin et al, 2017). The quality of decrypted and restored images could be significantly improved by utilizing spatial correlation.…”

Section: Introductionmentioning

confidence: 99%

Reversible Data Hiding in a Chaotic Encryption Domain Based on Odevity Verification

Liu

Wang

Meng

et al. 2021

International Journal of Digital Crime and Forensics

View full text Add to dashboard Cite

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

show abstract

Privacy-Preserving Outsourced Nash Equilibrium Computation in Cloud Computing

Zhang

Cheng

Zheng

et al. 2021

Communications in Computer and Information Science

View full text Add to dashboard Cite

Separable Reversible Data Hiding in Encrypted Image with Classification Permutation

Cited by 5 publications

References 11 publications

Intra-Block Correlation Based Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

Intra-Block Correlation Based Reversible Data Hiding in Encrypted Images Using Parametric Binary Tree Labeling

Reversible Data Hiding in a Chaotic Encryption Domain Based on Odevity Verification

Privacy-Preserving Outsourced Nash Equilibrium Computation in Cloud Computing

Contact Info

Product

Resources

About