Open AccessReversible data hiding in chaotic encryption domain based on odevity verification
Publication year - 2021
Publication title -
international journal of digital crime and forensics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.192
H-Index - 15
eISSN - 1941-6229
pISSN - 1941-6210
DOI - 10.4018/ijdcf.20211101oa03
Subject(s) - encryption , digital watermarking , computer science , pixel , image (mathematics) , artificial intelligence , computer vision , embedding , information hiding , redundancy (engineering) , algorithm , computer security , operating system
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.