Complete Separable Reversible Data Hiding for Encrypted Digital Images Using Code Division Multiplexing with Versatile Bit Depth Management

Abstract

A reversible data hiding in the encrypted domain (RDH-ED) aims to hide data within encrypted images, protecting its content, while allowing additional information to be distributed. This paper presents a complete separable RDH-ED scheme, whose main contribution is allowing the receiver to extract data and restore the image, either from the cryptogram with hidden data or from the directly decrypted version. With versatile bit-depth management, the most significant bits of each pixel are encrypted with AES-CTR cipher algorithm, while the additional data will be inserted inside the least significant bit planes of the encrypted pixels, by means of the code division multiplexing technique. Considering the marked/encrypted images, and encryption/data-hiding keys, a receiver could: (a) directly decrypt the encrypted image and obtain its approximate version, (b) extract the error-free hidden data, and (c) recover the data and original image. Considering an image approximation version and the data hiding key, a receiver could: (d) extract the hidden data from the plaintext domain, and (e) restore the image to its original state, while accessing the hidden data without any loss. Experimental results show the performance of the developed algorithm, evaluating the capacity and imperceptibility of the proposed scheme with respect to current state of the art.

Keywords

• complete separable reversible data hiding
• image encryption
• digital image processing
• information security
• code division multiplexing