Pixel Range Adaptive Modification Of Least Significant Bits For Information Hiding In Encrypted Image
Encryption and Information Hiding are the greater challenges for researchers to secure the data for intended users.
This paper proposes a scheme of information hiding in an encrypted image. First the image is encrypted using an encryption
key, which is random. Next the information hiding method subjects the encrypted image into two level decomposition, and
selects the sub images for secret information hiding. Embedding process uses the secret information as a text message.
Proposed method uses variable bit length which is adaptive, based on pixel range. Then embedding key is used for
information hiding by LSB substitution method, hence this algorithm increases the embedding rate. The information can be
extracted efficiently with embedding key and decryption of image using encryption key. In this method there is a tradeoff
between embedding rate and PSNR of decrypted image. Tradeoff depends on the selection of the embedding key. This
method gives, in an average eight times higher embedding rate, and also better PSNR and SSIM than the existing methods.
Keywords- Encryption; Information Hiding; Variable Bit Length, Decryption