International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 5, Issue 1, January - February 2016
ISSN 2278-6856

Space Reserving Before Encryption Using LSB

and Histogram Technique
1

Shreeram Gholap, 2Satish Todmal

ME student, Department of Computer Engg

JSPMS ICOER, Savitribai Phule, Pune University
2

HOD, Department of Computer Engg

JSPMS ICOER, Savitribai Phule, Pune University

Abstract: Lossless data recovery can be achieved if we are

able restore the original image without losing its state. It is
possible in proposed system; the idea behind this is reserving
space before encryption. By reserving space we can increase
the payload as compared to existing system. We have use
Histogram shifting for the data shrinking purpose; also it
prevents underflow and overflow problems.

Keywords: PSNR, MSE, LSB, RDH

1. INTRODUCTION
Some of the techniques used for data hiding are not
completely reversible. Due to the development of
multimedia and Internet, users accessing the multimedia
data are increasing rapidly. So, it has become very
important to protect the digital data. The solution for data
protection is the Reversible and Lossless data hiding
scheme. Most of the times in data hiding techniques
image is completely distorted and cannot be recovered to it
original form. The critical application like military and
medical, where small distortion is not acceptable. So, in
this case lossless data hiding is very useful where quality
of image is maintained after embedding the data.

2. LITERATURE REVIEW
The classification of Reversible data hiding is done in
three categories. They are as follows:
Based on data compression.
Difference expansion based on pixel value
Histogram shifting
All the above techniques aim at improving the capacity
the capacity of embedding and distortion free or low
distortion image recovery. Data hiding based on difference
expansion is having the problem of duplicate pixel values
in the image. Disadvantage of the existing system are as
follows:
1. Error rate increases as we increase the payload
messages.
2. Image restoration and Data extraction problem
is very severe and frequently occurs.

Volume 5, Issue 1, January February 2016

3. IMPLEMENTATION
Detail implementation of proposed system:
A) Image Encryption
In the proposed scheme ,the novel Data Encryption
Standard and Least Significant Bit algorithm for
image encryption is used. This methods involves secret
sharing of image by dividing it into multiple shares.
These shares are transmitted or stored on different
places in the storage server for security, the original
image could not be reconstructed unless we have all
the shares with us to combines. Thus the method
provides the security to the image in the sense that
image so divided into shares is protected and for
regeneration all the shares are required.
B) Decryption Process (Image Retrieval)
Image retrieval is the reverse process of the image
encryption. That
involves sieving the random shares
and retrieving R/G/B(A-Shuffle), R/G/B(B-Shuffle),
R/G/B(C-Shuffle), R/G/B(D-Shuffle) then from individual
shuffle shares the original RA,GA,BA , RB,GB,BB ,
RC,GC,BC and RD,GD,BD are generated. And using this
original image can be generated. The final image is
similar to the original image no distortion is occurred.
C) Data Extraction
After getting all the shares of the image the original
image can be reconstructed easily. Difference of the new
pixel value and original pixel value are considered and
Page 86

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 5, Issue 1, January - February 2016
ISSN 2278-6856
difference is calculated. The LSB of the difference is the
bit which is hided.

4. PROPOSED SYSTEM

Figure 4. Architecture of Proposed System

j in gray value and the number of pixels as N (N= N1 *

N2). In encryption phase, the exclusive-or results of the
original bits and pseudo-random bits are calculated and
concatenated as the encrypted data.
The data-hider randomly selects Np encrypted pixels that
will be used to carry the parameters for data hiding. Np is
a positive integer which is small, example, Np=20. (NNp) encrypted pixels are permuted and then divided into a
number of groups. Each of which contains L pixels. Each
and every pixel-group collect the M least significant bits
of the L pixels and denoted as B (k,1) , B (k,2)
B(k,M*L) where k is a group index within [1,(N-Np)/L] .
M is a positive integer less than 5. The matrix G is
generated by the data-hider which is composed of two
parts. The identity matrix is on the left-hand side and the
pseudo-random binary matrix derived from the datahiding key is on the right-hand side. A matrix of size (M *
L-S) is formed with G matrix product which contains
sparse bit of size S, in which the data is embedded. Then
pixels are arranged into the original form and
repermutated to form an original image.

5. RESULT
Comparison Table1.

The proposed architecture not only separate data

extraction from image decryption but also achieves high
performance
True reversibility is discovered where data extraction and
image recovery are free of any error.
For given embedding rates, the PSNRs of decrypted
image containing the embedded data are signicantly
improved and the range of embedding rates is greatly
enlarged

MSE

INPUT IMAGE
NAME/size(pixels)

EMBEDDING
PAYLOAD(bits)

PSNR(db)

Existing
System

Lena(256*256)

30496

62.5

.006

Proposed
System

Lena(256*256)

30496

73.5

.003

A) Least Significant Bit Algorithm:

Least significant bit helps to embed information in a cover
image. The least significant bit i.e. 8th bit inside an image
is changed to a bit of the secret data. When 24-bit image is
used, a bit red, green and blue component can be used.
This means we can store 3 bits in each pixel. An 800
600 pixel image, can store a total amount of 1,440,000
bits or 180,000 bytes of embedded data. A grid of 3 pixels
of a 24-bit image can be as follows:
1. 00101101 00011100 11011100
2. 10100110 11000100 00001100
3. 11010010 10101101 01100011
The number 200, binary representation is 11001000,
is embedded into the least significant bits of this part of
the image, the resulting grid is as follows:
1. 00101101 00011101 11011100
2. 10100110 11000101 00001100
3. 11010010 10101100 01100011
B) Mathematical Model:
The original image of a size N1 * N2 is in uncompressed
format. Each pixel with gray value is represented by 8 bits
and range is [0, 255] . The bits of a pixel is denoted as P i,

Volume 5, Issue 1, January February 2016

Lena image 1[12]

6. Conclusion
The data hiding using Reversible technique is very
popular as it is having great requirement from Cloud
computing area. The PSNR value is better as compared to
existing system, even MSE is very low. The proposed
scheme is achieving the quality image after decryption
and embedding process. The data hiding is effort \less and
improved performance in terms of distortion or error free
and restoring the image quality. Before encryption we are
reserving space due to this the hiding capacity is
increased.
Page 87

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 5, Issue 1, January - February 2016
ISSN 2278-6856
Acknowledgement
I would like to express thanks from bottom of my heart to
my Guide and HOD Prof. Satish R Todmal for his
valuable guidance. I also like to thanks all the faculty
members of ICOER who helped in making my dreams
come true.

References
[1.] W. Liu, W. Zeng, L. Dong, and Q. Yao, Efficient
compression of encrypted gray scale images, IEEE
Trans. Image Process., vol. 19, no. 4, pp. 10971102,
Apr. 2010.
[2.] X. Zhang, Reversible data hiding in encrypted
image, IEEE Signal Process. Lett., vol. 18, no. 4, pp.
255258, Apr. 2011.
[3.] J. Tian, Reversible data embedding using a
difference expansion,IEEE Trans. Circuits Syst.
Video Technol., vol. 13, no. 8, pp. 890896,Aug.
2003.
[4.] Z. Ni, Y.-Q. Shi, N. Ansari, and W. Su, Reversible
data hiding, IEEE Trans. Circuits Syst.Video
Technol., vol. 16, no. 3, pp. 354362, Mar.2006.
[5.] Singh, Akhand Pratap.(2014). Fortified Multimedia
Application.International Journal of Research. 1 (5),
p283-291.
[6.] A.Mayache, T. Eude, and H. Cherifi, A comparison
of image quality models and metrics based on human
visual sensitivity, in Proc. Int.Conf. Image
Processing (ICIP98), Chicago, IL, 1998, vol. 3, pp.
409413.
[7.] 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.
[8.] X. Zhang, Separable reversible data hiding in
encrypted image, IEEETrans. Inf. Forensics
Security, vol. 7, no. 2, pp. 826832, Apr. 2012A.
[9.] W. Hong, T. Chen, and H.Wu, An improved
reversible data hiding in encrypted images using side
match, IEEE Signal Process. Lett., vol.Int.Conf.
Image Processing (ICIP98), Chicago, IL, 1998, vol.
3, pp. 409413. 19, no. 4, pp. 199202, Apr. 2012.
[10.] K. Wong, K. Tanaka, K. Takagi, and Y.
Nakajima,Complete video quality-preserving data
hiding, IEEE Trans. Circuits Syst. Video Technol.,
vol. 19, no. 10, pp. 14991512, Oct. 2009.
[11.] T. Kalker and F.M.Willems,Capacity bounds and
code constructions for reversible data-hiding, in
Proc. 14th Int. Conf. DSP, 2002, pp. 7176.
[12.] Kede Ma, Weiming Zhang, Xianfeng Zhao,
Reversible Data Hiding in Encrypted Images by
Reserving Room Before Encryption in IEEE
transactions on information forensics and security,
vol. 8, no. 3, march 2013.

Volume 5, Issue 1, January February 2016

Page 88