Abstract

This paper proposes a scheme for detachable reversible data hiding in image encryption. In which the sender encrypts an image using encryption key. Then, the data is appended to the encrypted image using a data-hiding key. With an encrypted image containing additional data, if a receiver has the data-hiding key, he can extract the additional data though he does not know the content of the image. If the receiver has the encryption key, he can decrypt the encrypted image and get an image similar to the original one, but he cannot extract the additional data. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original image without any error.

Highlights

  • Signal processing in the encrypted domain has attracted considerable research interest recently

  • This paper proposes a scheme for detachable reversible data hiding in encrypted image

  • The eight encrypted bits of each pixel are converted into a gray value to generate an encrypted image and we embed additional bits into the encrypted image

Read more

Summary

INTRODUCTION

Signal processing in the encrypted domain has attracted considerable research interest recently. A number of reversible data hiding methods have been proposed in recent years This is the novel scheme that separates the data extraction and image decryption. With an encrypted image containing additional data, a receiver may first decrypt it according to the encryption key, and extract the embedded data according to the data-hiding key. The original image is encrypted using an encryption key and the additional data is embedded into the encrypted image using a data-hiding key. Since the data embedding only affects the LSB, a decryption with the encryption key can result in an image similar to the original version When using both of the encryption and data-hiding keys, the embedded additional data can be successfully extracted and the original image can be perfectly recovered.

Encode
Decode
RESULTS
CONCLUSION
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.