Abstract

This paper proposes a new reversible data hiding scheme for encrypted images by using homomorphic and probabilistic properties of Paillier cryptosystem. The proposed method can embed additional data directly into encrypted image without any preprocessing operations on original image. By selecting two pixels as a group for encryption, data hider can retrieve the absolute differences of groups of two pixels by employing a modular multiplicative inverse method. Additional data can be embedded into encrypted image by shifting histogram of the absolute differences by using the homomorphic property in encrypted domain. On the receiver side, legal user can extract the marked histogram in encrypted domain in the same way as data hiding procedure. Then, the hidden data can be extracted from the marked histogram and the encrypted version of original image can be restored by using inverse histogram shifting operations. Besides, the marked absolute differences can be computed after decryption for extraction of additional data and restoration of original image. Compared with previous state-of-the-art works, the proposed scheme can effectively avoid preprocessing operations before encryption and can efficiently embed and extract data in encrypted domain. The experiments on the standard image files also certify the effectiveness of the proposed scheme.

Highlights

  • Reversible data hiding (RDH) is an efficient technology for cover authentication or content integrity verification [1,2,3] in which the hidden data can be extracted completely and the original carrier can be recovered losslessly after data extraction

  • 2.2 Modular multiplicative inverse method For better description, we introduce the principle of modular multiplicative inverse (MMI) method first

  • One of the two ciphertexts is further encrypted with another parameter r2 so that their difference can be transmitted to encrypted domain

Read more

Summary

Introduction

Reversible data hiding (RDH) is an efficient technology for cover authentication or content integrity verification [1,2,3] in which the hidden data can be extracted completely and the original carrier can be recovered losslessly after data extraction. In [25], Chen et al first raised a novel RDHEI method with public key cryptography by dividing a pixel into two parts: LSB and the rest Image owner encrypted these two parts with Paillier mechanism and transmitted them to data hider. Aiming at retrieving the hidden data in encrypted domain, Zhang et al proposed a new reversible data hiding algorithm with public key cryptosystem [26] by using a pre-procession operation to shrink histogram of original image to vacate room for data hiding. This paper proposes a new reversible data hiding scheme in the homomorphic encrypted domain with public key cryptosystem. This paper is very useful since the data hiding scheme can be used for both privacy protection and cloud computing due to homomorphic and probabilistic properties of Paillier cryptosystem.

Paillier cryptosystem and modular multiplicative inverse method
Reversible data hiding scheme with public key cryptosystem
Data hiding
Data embedding
Extract hidden data and restore original ciphertext image in encrypted domain
Extract the hidden data and restore the original image after decryption
Methods
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call