Abstract

This paper proposes a reversible data hiding scheme by exploiting the DGHV fully homomorphic encryption, and analyzes the feasibility of the scheme for data hiding from the perspective of information entropy. In the proposed algorithm, additional data can be embedded directly into a DGHV fully homomorphic encrypted image without any preprocessing. On the sending side, by using two encrypted pixels as a group, a data hider can get the difference of two pixels in a group. Additional data can be embedded into the encrypted image by shifting the histogram of the differences with the fully homomorphic property. On the receiver side, a legal user can extract the additional data by getting the difference histogram, and the original image can be restored by using modular arithmetic. Besides, the additional data can be extracted after decryption while the original image can be restored. Compared with the previous two typical algorithms, the proposed scheme can effectively avoid preprocessing operations before encryption and can successfully embed and extract additional data in the encrypted domain. The extensive testing results on the standard images have certified the effectiveness of the proposed scheme.

Highlights

  • Reversible data hiding [1,2,3] is an efficient technology that combines the robustness and provability of digital information, and embeds information for authentication

  • We propose a new reversible data hiding scheme in the fully homomorphic encrypted domain with the DGHV public key cryptosystem which was proposed by Dijk, Gentry, Halevi and Vaikuntanathan in [26]

  • The correlation between adjacent pixels can be transmitted to the encrypted domain

Read more

Summary

Introduction

Reversible data hiding [1,2,3] is an efficient technology that combines the robustness and provability of digital information, and embeds information for authentication. Reversible data hiding technique in encrypted domain can implement data hiding procedure in encrypted domain and can recover the original plaintext without error after decryption and data extraction. Owing to this merit, reversible data hiding in encrypted images has been a research hotspot in information security community recently. In [21], by using absolute mean difference of multiple neighboring pixels, the authors proposed a reversible data hiding algorithm in encrypted domain. We propose a new reversible data hiding scheme in the fully homomorphic encrypted domain with the DGHV public key cryptosystem which was proposed by Dijk, Gentry, Halevi and Vaikuntanathan in [26].

Shannon Information Theory
Fully Homomorphic Encryption over the Integers
Key Generation
Encryption
Homomorphic Addition
Reversible Data Hiding Scheme with Public Key Cryptosystem
Image Encryption
Data Hiding
Data Embedding
Data Extraction and Image Restoration
Extract the Hidden Data and Restore the Original Image after Decryption
Experimental Results
Computational Cost
Security
Imperceptibility
Original Images and Their Processed Versions
Performance Comparison
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