| Summary: | During the last few decades, multimedia security over the cloud has become a major issue. Public-key homomorphism is an efficient approach for data hiding in encrypted images (DHEI). An original image is encrypted using a public key and sent across a network and then processed to embed a secret message directly in the encrypted domain. During the decoding step, a private key is used to obtain a marked reconstructed image, where the secret message can be extracted. In this paper, we propose an efficient method of DHEI based on the Paillier cryptosystem. Using its homomorphic properties, pixel blocks and bits of the message are multiplied in the encrypted domain resulting in an addition in the clear domain. By applying a pre-processing step on the original image before encryption, this addition becomes a least significant bits (LSB) substitution. Experimental results show that using our proposed scheme, we obtain a high payload value (1 bpp) without expanding a lot the original image size contrary to current state-of-the-art methods. Indeed, whatever the key size, the expansion rate is always equal to 2. In addition, the original image and the marked reconstructed image are very similar.
|
|---|
