Document 2 NZ5E 16042015

ISSN 2394-3777 (Print)
ISSN 2394-3785 (Online)

Available online at www.ijartet.com
International Journal of Advanced Research Trends in Engineering and Technology (IJARTET)
Vol. II, Special Issue X, March 2015 in association with
HOLY GRACE ACADEMY OF ENGINEERING
ORGANIZES
NATIONAL LEVEL CONFERENCE ON INNOVATIVE ENGINEERING
TH
(16-20 MARCH 2015)
Reversible Data Hiding in Encrypted Images by

Reserving Room Before Encryption
Vidhu K.Vikram1, Jeslin P.Jo2
Post-Graduate
Graduate Scholar, Department of Electronics and Communication, FISAT, Ernakulam, India 1
Assistant Professor, Department of Electronics and Communication, FISAT, Ernakulam, India 2
Abstract: Recently, more and more attention is paid to reversible Data Hiding (RDH
(RDH)) in encrypted images, since it
maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while
protecting the image contents condentiality.
dentiality. All previous methods embed data by reversibly vacating room from the
encrypted images, which may be subject tto
o some errors on data extraction and/or image restoration. In this paper, we
propose a novel method by reserving room before encryption with a traditional RDH algorithm, and thus it is easy for the
data hider to reversibly embed data in the encrypted image
image.. The proposed method can achieve real reversibility, that is, data
extraction and image recovery are free of any error. Experiments show that this novel method can embed more than 10
times as large payloads for the same image quality as the previous metho
methods,
ds, such as for PSNR =40 dB.The
dB.
programming
and simulation of the processes as well as the analysis of the results were done using MATLAB.
Keywords: Reversible Data Hiding; Image Encryption
Encryption; Privacy Protection; Histogram Shift
I.INTRODUCTION
Reversible Data Hiding in images is a technique by which
the original cover can be loselessly recovered after the
embedded message is extracted. This important technique is
widely used in medical imagery,military imagery and law
forensics,where no distortion of the original cover iis
allowed.Since
Since first introduced,RDH has attracted
considerable research interest.
In theoretical aspect, Kalker and Willems [1] established
arate-distortion
distortion model for RDH, through which they proved
the rate-distortion
distortion bounds of RDH for memoryless covers
and proposed a recursive code construction which, however,
does not approach the bound. Zhang et al. [2], [3] improved
the recursive code construction for binary covers and proved
that this construction can achieve the rate
rate-distortion bound
as long as the compression algorithm reaches entropy, which
establishes the equivalence between data compression and
RDH for binary covers.
This paper is organized in the following manner. Section II
briey
y introduces previous methods proposed in [16]
[16][18].
The novel method is elaborated in Section III followed by
some implementation issues in Section IV. Experiments with
analysis and comparison are given in Section V. The paper is
concluded in Section VI.
II.PREVIOUS ARTS
The methods proposed in [16][18]
[18] can be summarized as
the framework, vacating room after encryption (VRAE),
as illustrated in Fig. 1(a).
In this framework, a content owner encrypts the original
image using a standard cipher with an encryption key. After
producing the encrypted image, the content
cont
owner hands
over it to a data hider (e.g., a database manager) and the data
hider can embed some auxiliary data into the encrypted
image by losslessly vacating some room according to a data
hiding key. Then a receiver, maybe the content owner
himself orr an authorized third party can extract the
embedded data with the data hiding key and further recover
the original image from the encrypted version according to
the encryption key.
In all methods of [16][18],
[18], the encrypted 8-bit
8
gray-scale
images are generated
erated by encrypting every bit-planes
bit
with a
stream cipher. The method in [16] segments the encrypted
image into a number of nonoverlapping blocks sized by
a*a;each
;each block is used to carry one additional bit. To do this,
A
All Rights Reserved 2015 IJARTET
766

ORGANIZES
TH
(16-20 MARCH 2015)
pixels in each block are pseudo-randomly

omly divided into two that the reserving operation we adopt in the proposed
sets and according to a data hiding key.
method is a traditional RDH approach.
Hong et al. [17] reduced the error rate of Zhangs method

[16] by fully exploiting the pixels in calculating the
smoothness of each block and using side match. The
extraction and recovery of blocks are performed according
to the descending order of the absolute smoothness
difference between two candidate blocks and recovered
blocks can further be used to evaluate the smoothness of
unrecovered blocks, which is referred to as side match.
III.PROPOSED METHOD
Since losslessly vacating room from the encrypted images is
relatively difcult
cult and sometimes inefcient, why are we
still so obsessed to nd novel RDH techniques working
directly for encrypted images? If we reverse the order of
encryption and vacating room, i.e., reserving room prior to
image encryption at content owner side, the RDH tasks in
encrypted images would be more natural and much easier
which leads us to the novel framework, reserving room
before encryption (RRBE).
As shown in Fig.1(b),thecontentownerrst
rst reserves enough
space on original image and then converts the image into its
encrypted version with the encryption key. Now, the data
embed ding process in encrypted images is inherently
reversible for the data hider only needs to accommodate data
into the spare space previous emptied out. The data
extraction and image recovery are identical to that of
Framework VRAE. Obviously, standard RDH algorithms
are the ideal operator for reserving room before encryption
and can be easily applied to Framework RRBE to achieve
better performance compared with techniques from
Framework VRAE. This is because in this new
framework,we follow the customary idea that rst losslessly
compresses the redundant image content (e.g., using
excellent RDH techniques) and then encrypts it with respect
to protecting privacy.
Next, we elaborate a practical method based on the
Framework RRBE, which primarily consists of four
stages: generation of encrypted image, data hiding in
encrypted image, data extraction
on and image recovery. Note
Fig. 1. Block Diagram of (a) Framework VRAE. (b) Framework

RRBE.
A. Generation of Encrypted Image

Actually, to construct the encrypted image, the rst stage can
be divided into three steps: image partition, self reversible
embedding followed by image encryption. At the beginning,
image partition step divides original image into two parts A
and B ; then, the LSBs of A are reversibly embedded into B
with a standard RDH algorithm so that LSBs of A can be
used for accommodating messages; at last, encrypt the
rearranged image to generate its nal version.
1) Image Partition: The operator here for reserving room
before encryption
cryption is a standard RDH technique, so the goal
of image partition is to construct a smoother area B on which
A
767

ORGANIZES
TH
(16-20 MARCH 2015)
standard RDH algorithms such as [10], [11] can achieve

better performance. To do that, without loss of generality,
assume the original image is an 8 bits gray
gray-scale image with
its size M*N.First the content owner extracts from the
original image ,number of non-overlapping
overlapping blocks.Each
block has m rows,where m=ceil(l/N);l
m=ceil(l/N);l-size of to-be
embedded messages.For each block a smoothness function f
is calculated.
Higher f relates to blocks which contain relatively more

complex textures. The content owner, therefore, selects the
particular block with the highest f to be , and puts it to the
front of the image concatenated by the rest part with fewer
textured areas.
2) Self-Reversible Embedding: The goal of self
self-reversible
embedding is to embed the LSB-planes
planes of A
Ainto B by
employing traditional RDH algorithms. For illustration, we
simplify the method in [10] to demonstrate
rate the process of
self-embedding. Pixels in the rest of image are rst
categorized into two sets: white pixels with its indices i and j
satisfying (i+j)mod 2=0 and black pixels whose indices meet
(i+j)mod 2=1.Then,
Then, each white pixel,is estimated by the
interpolation value obtained with thee average of four
neighbouring black pixels.The estimation error is calculated
by taking the difference between the white ppixel and the
average.This difference is multiplied by 2 to make its LSB
zero.This is added with the LSB of A.Then this value iis
added with the white pixel value.So,now LSB of A is
embedded in a pixel in B.
3) Image Encryption: After rearranged self
self-embedded image
is generated, we can encrypt it to construct the encrypted
image.With a stream cipherthe encryption version is eas
easily
obtained.Original image is XORed with the random key
generated.
B. Data Hiding in Encrypted Image
Once the data hider acquires the encrypted image hecan
embed some data into it, although he does not get access to
the original image. The embedding process starts with
locating the encrypted version ofA. Since it has been

rearranged to the top of A, it is effortless for the data hider
to read 10 bits information in LSBs of rst 10 encrypted
pixels. After knowing how many bit--planes and rows of
pixels he can modify, the data hider simply adopts LSB
replacement to substitute the available bit-planes
bit
with
additional data.
C. Data Extraction and Image Recovery
Since data extraction is completely independent from image
decryption, the order of them implies two different practical
applications.One
.One is extracting data from encrypted images
and the other is extracting data from decrypted images.
Case 1:Extracting
Extracting Data from Encrypted Images
To manage and update personal information of images
which are encrypted for protecting clients privacy, an
inferior database manager may only get access to the data
hiding key and have to manipulate data in encrypted domain.
The order of data extraction before image decryption
guaran;tees the feasibility of our work in this case.
case
Case 2: Extracting Data from Decrypted Images
This is the situation in which the user wants to decrypt the
image rst and extracts the data from the decrypted image
when it is needed. The following example
examp is an application
for such scenario. Assume Alice outsourced her images to a
cloud server, and the images are encrypted to protect their
contents. Into the encrypted images, the cloud server marks
the images by embedding some notation, including the
identity of the images owner, the identity of the cloud
server and time stamps, to manage the encrypted images.
Note that the cloud server has no right to do any permanent
damage to the images. Now an authorized user, Bob who has
been shared the encryption key and the data hiding key,
downloaded and decrypted
ed the images. Bob hoped to get
marked decrypted images, i.e., decrypted images still
including the notation, which can be used to trace the source
and history of the data.. The order of image decryption
before/without data extraction is perfectly suitable
suitab for this
case.
a)Generation Of Marked Decrypted Image
The marked encrypted image is XORed with encryption key
to obtain the marked decrypted image.
A
768

ORGANIZES
TH
(16-20 MARCH 2015)
b) Data Extraction and Image Restoration: After generating

the marked decrypted image, the content owner can further
extract the data and recover original image. The pr
process is
essentially similar to that of traditional RDH method
method. Using
the data hiding key, the image is decrypted first in the same
manner as that of encryption-xor
xor cipher is used
used.Now marked
decrypted
crypted image is generated.Data is retrieved by reading
out the information in the first row of A.Then based on this
information lsb of each pixel is taken and converted back to
string. Data is retrieved. Image is decrypted using
decryption key by XOR cipher.Now
Now ,rearrange the image in
its original form by taking the LSBs in B back to A.
term of PSNR. Fig. 3 plots the PSNR results of different

marked decrypted images under given embedding
rates.From this figure,it can be observed that over all range
of embedding rate, for all cases, our approach outperforms
state-of-the-art
art RDH algorithms in encrypted images. The
gain in terms of PSNR is signicantly
cantly high at embedding
rate range that the methods in [16][18]
[16]
can achieve. In
addition, another advantage of our approach is the much
wider range of embedding
bedding rate for acceptable PSNRs. In
fact, the proposed method can embed more than 10 times as
large payloads for the same acceptable PSNR (e.g.,=40dB)
as the methods in [16][18],
[18], which implies a very good
potential for practical applications.
IV. IMPLEMENTATION ISSUES

The proposed approach will be tested on public available
standard images, which include Lena, Airplane,
Barbara,Baboon, Peppers and Boat [19]. The size of
all images is 512*512* 8. The objective criteria PSNR is
employed to evaluate the quality of marked decrypted image
quantitatively. To achieve high PSNRs, several implement
details for the proposed method are taken into account su
such
as choice of LSB-plane
plane number,choice of embedding
strategy and discussion on boundary map.
V. EXPERIMENTS AND COMPARISONS
The standard image Lena, shown in Fig. 2(a) is taken, to
demonstrate the feasibility of proposed method. Fig. 2(b) is
the encrypted image containing embedded messages and the
decrypted version with messages is illustrated in Fig. 2c).
Fig. 2. (a) Original image, (b) encrypted image, (c) decrypted image
containing messages (embedding rate 0.1 bpp), (d) recovery version.
Fig. 2d) depicts the recovery version which is identical to

original image.Then compared the proposed method with the
state-ofthe-art works [16][18].The
[18].The proposed method is free
of any error for all kinds of images compared to other Fig. 3. PSNR comparison with the methods of Zhang [16], Hong [17] and
Zhang [18]. (a) Lena, (b) Airplane, (c) Barbara, (d) Baboon, (e) Peppers, (f)
methods.
The quality of marked decrypted images is compared in the Boat.
A
769

ORGANIZES
TH
(16-20 MARCH 2015)
[8]
VI.CONCLUSION
Reversible data hiding in encrypted images is a new topic
drawing attention because of the privacy
privacy-preserving
requirements from cloud data management. Previous
methods implement RDH in encrypted images by vacating
room after encryption, as opposed to which we proposed by
reserving room before encryption. Thus the data hider can
benet from the extra
xtra space emptied out in previous stage to
make data hiding process effortless. The proposed method
can take advantage of all traditional RDH techniques for
plain images and achieve excellent performance without loss
of perfect secrecy. Furthermore, this novel method can
achieve real reversibility, separate data extraction and
greatly improvement on the quality of marked decrypted
images.
[9]
[10]
[11]
[12]
[13]
[14]
X. L. Li, B. Yang, and T. Y. Zeng, Efcient

cient reversible watermarking
based on adaptive prediction-error
error expansion and pixel selection,
IEEE Trans. Image Process.,, vol. 20, no. 12, pp. 35243533,
3524
Dec.
2011.
P. Tsai, Y. C. Hu, and H. L. Yeh, Reversible image hiding scheme
using predictive coding and histogram shifting, Signal Process., vol.
89, pp. 11291143, 2009.
L. Luo et al.,, Reversible image watermarking using interpolation
technique, IEEE Trans. Inf. Forensics Security,
Security vol. 5, no. 1, pp.
187193, Mar. 2010.
V. Sachnev, H. J. Kim, J. Nam, S. Suresh, and Y.-Q.
Y.
Shi, Reversible
watermarking algorithm using sorting and prediction, IEEE Trans.
Circuits Syst. Video Technol.,, vol. 19, no. 7, pp. 989999,
989
Jul. 2009.
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone,
Vanstone Handbook of
Applied Cryptography.. Boca Raton, FL, USA: CRC,
CR 1996.
K. Hwang and D. Li, Trusted cloudcomputingwithsecureresources
and data coloring, IEEE Internet Comput.,
Comput. vol. 14, no. 5, pp. 1422,
Sep./Oct. 2010.
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. 29923006,
3006, Oct. 2004.
ACKNOWLEDGMENT
[15] W.. Liu, W. Zeng, L. Dong, and Q. Yao, Efcient
Ef
compression of
This work is supported and guided by my research guide.
encrypted grayscale images, IEEE Trans. Image Process.,vol.19,no.4,
pp. 10971102, Apr. 2010.
I am very thankful to myy research guide Ms. Je
Jeslin P.Jo,
Zhang, Reversible data hiding in encrypted images, IEEE Signal
Assistant Professor, Electronics and Communication [16] X.
Process. Lett., vol. 18, no. 4, pp. 255258,
258, Apr. 2011.
Engineering, Federal Institute of Science and Technology [17] W. Hong, T. Chen, and H. Wu, An improved reversible data hiding
(FISAT), India, for her guidance and support
support.
in encrypted images
es using side match, IEEE Signal Process. Lett.,
[1]
[2]
[3]
[4]
[5]
[6]
[7]
vol. 19, no. 4, pp. 199202, Apr. 2012.

[18] X. Zhang, Separable reversible data hiding in encrypted image,
IEEE Trans. Inf. Forensics Security, vol. 7, no. 2, pp. 826832,
826
Apr.
REFERENCES
2012.
[19] Miscelaneous
Gray
Level
Images
[Online].
Available:
http://decsai.ugr.es/cvg/dbimagenes/g512.php
.ugr.es/cvg/dbimagenes/g512.php
T. Kalker and F. M. Willems, Capacity bounds and code
constructions for reversible data-hiding,
hiding, in Proc. 14th Int. Conf.
Digital Signal Processing(DSP2002),, 2002, pp. 71
7176.
W. Zhang, B. Chen, and N. Yu, Capacity-approaching
approaching codes for
BIOGRAPHY
reversible data hiding, in Proc 13th Information Hiding (IH2011),
LNCS 6958, 2011, pp. 255269, Springer-Verlag.
Verlag.
W. Zhang, B. Chen, and N. Yu, Improving
proving various reversible data
hiding schemes via optimal codes for binary covers, IEEE Trans.
Image Process., vol. 21, no. 6, pp. 29913003,
3003, Jun. 2012.
Vidhu K.Vikram received the BTech
J. Fridrich and M. Goljan, Lossless data embedding for all image
degree
in
Electronics
and
formats, in Proc. SPIE Proc. Photonics West, Electronic Imaging,
Security and Watermarking of Multimedia Contents
Contents, San Jose, CA,
Communication
Engineering
from
USA, Jan. 2002, vol. 4675, pp. 572583.
Calicut University, Kerala, India, in
J. Tian, Reversible
sible data embedding using a difference expansion,
2013. Currently,
ntly, she is post graduate
IEEE Trans. Circuits Syst. Video Technol.,, vol. 13, no. 8, pp. 890
890896
student with the Department of Communication
Aug. 2003.
Z. Ni, Y. Shi, N. Ansari, and S. Wei, Reversible data hiding, IEE Engineering, Federal Institute of Science and Technology
Trans. Circuits Syst. Video Technol.,, vol. 16, no. 3, pp. 354362, (FISAT), Kerala, India. Her current research area includes
Mar.2006.
D. M. Thodi and J. J. Rodriguez, Expansion embedding techniques wireless networking and image processing.
for
reversible
watermarking,
IEEE
Trans.
Image
Process.,vol.16,no.3, pp. 721730, Mar. 2007.
A
770

ORGANIZES
TH
(16-20 MARCH 2015)
Jeslin P. Jo received the B

Bachelor's
degree in Electronics and Com
Communication
Engineering in 2009, from Viswajyothi
College of Engineering and Technology
Technology,
Kerala, India. and
nd M.Tech in Applied
Electronics from Jaya Engineering
College,Thiruninravur,Tamil
Thiruninravur,Tamil Na
Nadu, India
in 2013. Since July 2013, she has been working as a
Assistant Professor in Federal Institute of Science and
Technology (FISAT), Kerala, India.
A
771

Document 2 NZ5E 16042015

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Document 2 NZ5E 16042015

Încărcat de

Drepturi de autor:

Formate disponibile

ISSN 2394-3777 (Print)

ISSN 2394-3785 (Online)

Reversible Data Hiding in Encrypted Images by

ISSN 2394-3777 (Print)

pixels in each block are pseudo-randomly

Hong et al. [17] reduced the error rate of Zhangs method

Fig. 1. Block Diagram of (a) Framework VRAE. (b) Framework

A. Generation of Encrypted Image

ISSN 2394-3777 (Print)

standard RDH algorithms such as [10], [11] can achieve

Higher f relates to blocks which contain relatively more

locating the encrypted version ofA. Since it has been

ISSN 2394-3777 (Print)

b) Data Extraction and Image Restoration: After generating

term of PSNR. Fig. 3 plots the PSNR results of different

IV. IMPLEMENTATION ISSUES

Fig. 2d) depicts the recovery version which is identical to

ISSN 2394-3777 (Print)

X. L. Li, B. Yang, and T. Y. Zeng, Efcient

vol. 19, no. 4, pp. 199202, Apr. 2012.

ISSN 2394-3777 (Print)

Jeslin P. Jo received the B

S-ar putea să vă placă și