Abstract

With the development of cloud storage and privacy protection, reversible data hiding in encrypted images (RDHEI) plays the dual role of privacy protection and secret information transmission. RDHEI has a good application prospect and practical value. The current RDHEI algorithms still have room for improvement in terms of hiding capacity, security and separability. Based on (7, 4) Hamming Code and our proposed prediction/ detection functions, this paper proposes a Hamming Code and UnitSmooth detection based RDHEI scheme, called HUD-RDHEI scheme for short. To prove our performance, two database sets—BOWS-2 and BOSSBase—have been used in the experiments, and peak signal to noise ratio (PSNR) and pure embedding rate (ER) are served as criteria to evaluate the performance on image quality and hiding capacity. Experimental results confirm that the average pure ER with our proposed scheme is up to 2.556 bpp and 2.530 bpp under BOSSBase and BOWS-2, respectively. At the same time, security and separability is guaranteed. Moreover, there are no incorrect extracted bits during data extraction phase and the visual quality of directly decrypted image is exactly the same as the cover image.

Highlights

  • Digital images are widely used in media, publishing, medicine, military, and other fields

  • The primary is derived from the least significant bits (LSBs) of three continuous pixels

  • As for the original LSBs of three continuous pixels, they will be be filled by partial scrambled secrets by data hider with LSB substitution, which is differembedded into non-LSB planes with (7, 4) Hamming Code for complete recovery later

Read more

Summary

Introduction

Digital images are widely used in media, publishing, medicine, military, and other fields. When need to be embedded into the encrypted image by service provider, called as data needed, the user, more technically known here as the receiver can download the marked hider. The receiver can either use the hiding key K to get secret data or use the images. The receiver can either use the hiding key Khhto get secret data or use the encryption key K to get the original image. 2. Preliminaries hidingThis mostly belongs to with irreversible data hiding.information, In the process embedding section begins some background thenofintroduces andand disextracting additional information, it will cause irreversible modification to the image cusses some representative methods. Barton [22] first posed HUD-RDHEI scheme and the key techniques used to overcome the current shortproposed the concept of reversible data hiding (RDH).

Backgound
The Proposed HUD-RDHEI Scheme
Unit described in conclusion
The Proposed Flipping-MSB Method
MED 2Prediction and Our Defined
TheTable comparison result between
Hiding
Encrypted Image Generation
Thethe other two
Data Embedding in the Encrypted Image
Data Extraction with Only a Data Hiding Key
Image Decryption with Only the Data Encryption Key
15. Example
Results and Analysis
Performance
17. Results demonstration of the proposed
18. The values of ‘Lena’
Comparisons with Closely Related State-of-the-Art Methods
Time Complexity Analysis
Conclusions and Future Work
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