SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE
PROJECT GUIDE
ANEESH M HANEEF
GROUP MEMBERS
ABDUL GAFOOR
AMAR C
DILSHEER ALI P
JAMSHID ALI M P
CONTENTS
INTRODUCTION
EXISTING SYSTEM
PROPOSED SYSTEM
IMPLEMENTATION
SCREENSHOTS
ARCHITECTURE DIAGRAM
CONCLUSION
-
REFERENCE
INTRODUCTION
This work proposes a novel scheme for separable reversible data hiding in encrypted images. In the first phase, a content owner encrypts the original uncompressed image using an encryption key. Then the data-hider can hide data in the encrypted image by manipulating the LSB of the image pixel. 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 image content. If the receiver has the encryption key,he can decrypt the received data to obtain an image similar to the original one, but cannot extract the additional data. If he has both the key , he can extract the data and recover the original image.
EXISTING SYSTEM
The image is encrypted using a encryption key and the data is embedded using the same key.
The user who knows this key can access both the image and data.
The image can view only after removing the data.
PROPOSED SYSTEM
The image is encrypted using a encryption key and data is embedded using data hiding key.
Receiver can extract the data using data hiding key.
Receiver can decrypt the image using encryption key without removing the embedded data.
If the receiver has both the keys , he can access both the image and data.
Image Encryption
Data-Hiding
Image Decryption / Data Extraction
IMAGE ENCRYPTION
Read the pixels of image into a array.
Generate key-stream using the RC4 algorithm.
XOR each pixel with the generated key-stream.
Original Image

Encrypted Image

DATA HIDING
Shuffle the encrypted pixel array using Fisher-Yates algorithm which uses a pseudo random number generator which is seeded by a data-hiding key.
Hide the data in the shuffled array by manipulating the LSB of each element.
Shuffle the array back to its original position using the Fisher-yates.
Encrypted Image
Encrypted Image with Data Hidden
IMAGE DECRYPTION / DATA EXTRACTION
Three cases can occur:-
Receiver only have encryption key
Receiver only have data-hiding key
Receiver has both the keys
Receiver only have the encryption key
Read the image pixels into an array
Generate the key-stream using the encryption key
XOR the key-stream with the pixel array and rebuild the original image
Receiver only have the data-hiding key
Read the image pixel into a array.
Shuffle the array using Fisher-Yates according to the data-hiding key.
Extract the LSB of the shuffled array.
Receiver have both keys
Read the pixel into an array.
Extract the data using data-hiding key.
Decrypt the original image using the encryption key.

SCREENSHOTS
Select the operation we want to perform
Enter the details and press Encrypt for encryption

Enter the keys and press decrypt for decryption

(a)Original Image (b)Encrypted Image (c)Encrypted image with data embedded
(d)Decrypted version of image
ARCHITECTURE DIAGRAM

CONCLUSION
In conclusion, using our proposed scheme we were able to encrypt an image using the encryption key and embed data into the image using data-hiding key. Both the image and the data can be retrieved separately.
REFERENCE
Xinpeng Zhang- "Separable Reversible Data Hiding in Encrypted Image", IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 7, NO. 2, APRIL 2012
M. Johnson, P. Ishwar, V. M. Prabhakaran, D. Schonberg, and K.Ramchandran, “On compressing encrypted data,” IEEE Trans. Signal Process., vol. 52, no. 10, pp. 2992–3006, Oct. 2004.
W. Liu, W. Zeng, L. Dong, and Q. Yao, “Efficient compression of encrypted grayscale images,” IEEE Trans. Image Process., vol. 19, no. 4,pp. 1097–1102, Apr. 2010.
X. Zhang, “Lossy compression and iterative reconstruction for encrypted image,” IEEE Trans. Inform. Forensics Security, vol. 6, no. 1,pp. 53–58, Feb. 2011
Thank You
miniproject_1
By amar_c
miniproject_1
- 3,433

