Secure Color Visual Secret Sharing Scheme Using Shifting Coefficient with No Pixel Expansion
John Justin M, Manimurugan S, Alagendran B
Department of Computer Science and Engineering, Karunya University,
Coimbatore,India
Abstract-The focus is to design a framework for a color visual secret sharing scheme highlighting towards its security and pixel expansion problems. A Secret image has been diffused in between two meaningful cover images called share images. The participant who stacks both the share images can only obtain the secret image. In addition to that an extra confidential image has been embedded in share images to provide additional security in promoting the authentication to the participant and it carries the lifetime of the secret image. To reveal the extra confidential image, place the first share constantly and shift the second share to some unit. In this Paper a shifting coefficient value has been introduced to shift the second share image to certain unit, here the shifting coefficient acts as a key in-between the participant without which the Extra confidential image will not be revealed, which promotes good level of security also no pixel value has been expanded throughout the process.
Keywords-Visual Cryptography, Visual Secret Sharing Scheme, No Pixel expansion, Shifting Coefficient.
I. INTRODUCTION
Internet is important but insecure platform for communication. Many digital images that carry secret information are transmitted via internet. Hence it becomes common, sending secret information through internet in our day to day life. Once if the Secret information is leaked to unauthorized users then it leads to unpredictable loss to the owner or participant. For example, if the bank accounts detail or credit card information were leaked then it leads to financial risk. Therefore it is necessary to secure the secret information while transmitting it through internet. For securing the information many encryption algorithm has been proposed earlier like conventional cryptosystem such as AES(Advanced Encryption Standard),DES(Data Encryption Standard),ECC (Elliptic Curve
Cryptography),RSA (RSA) they are vulnerable to the attacks perform by the attackers one or in the other way. In order to meet this vulnerability data hiding scheme like visual secret sharing scheme has been proposed. Visual Secret Sharing actually hides a secret image in two cover images called share images and sends it via internet; the participant at the receiver end stacks both the image to reveal the secret image. Mainly it does not need any computation work rather the secret image can be viewed by the human vision. The extra confidential image is revealed by placing the first share image constantly and shifting the second share image to certain units by using the shifting coefficient value introduced in this paper. The shifting coefficient is a key like structure added during the embedding of the extra confidential image into the cover images and the key value is needed while extracting of the share images to reveal the extra confidential image.
II. LITERATURE SURVEY
Der Chyuan Lou et al proposed a visual secret sharing scheme with authentic ability using the non expanded meaningful shares. Along with the hiding of secret image in two cover images which are called share images, this method embeds an additional confidential image in share images. the secret image by placing it one on another. Then first share image is kept constant and another share image is shifted for certain unit to obtain the extra confidential image which holds the validity and the data about the data of the revealed secret image. The main advantage is using the color images with no pixel expansion.[1] Y. F. Chang et al has jointly proposed a data hiding scheme using the pixel swapping method for Halftone images. In this paper, promotes the halftone share image with high clarity and the secret image can be viewed directly by the human eyes by attacking each shares. This paper proves the
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3793
good level of increase in terms of quality of the obtained secret image when compared with the other existing techniques.[2]
Hsien Chu Wu et al has put forth a visual cryptographic method for color images using the meaningful shares. In this paper, the halftone technique is used along with the (CCT) cover coding table and (SCT) secret coding table for generating the meaningful shares to avoid the attention of the hackers or attackers. Here the secret image is obtained by superimposing the two share images one on another. Results shows good achievement in attaining good range of security.[3]
Shyong Jian Shyu has designed a framework for Image encryption by using random grids. When compared to the existing visual cryptography schemes, this algorithm does not need any basis matrices for encoding the shares. Hence the pixel expansion problem has been fixed.[4]
A novel secret image sharing scheme for the true color images with size constraint was proposed by Du-Shiau Tsai. In this paper, the combination of neural networks with the variant visual image secret sharing scheme, the quality of the revealed secret images and camouflage images were observed to be the same to its appropriate original images. Experimental results proves the feasibility of the method.[5]
Modifying
Diffusion
Stacking
Fig 1. Block diagram of Der-Chyuan Lou et al’s model [1]
Stacking
Swap Kernel
Fig 2. Block diagram of Chang et al’s model [2]
Halftone Cover Image HA
Halftone Cover Image HB
Secret
Image
S
Share
Image
B
Share
Image
A
Revealed
Secret
Image
*
+
*
Halftone Cover Image HA
Halftone Cover Image HB
Secret
Image
S
Share
Image
B
Share
Image
A
Revealed
Secret
Image
+
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3794
1.
neconeHalmaypixegraydendegparttonipixedistnot distfourdith the valu
Wh ,
an
Fig
A. A Error Di
Before diffucessary to conve extra conlftonning is thy vary in theels. Hence thyscale with th
nsity of the blagree of graysticular area reing, Floyd Stel has been vtribute the err
been visitetributing the qr neighboring
hering process
The Floyd Stfollowing eq
ue for all the p
.
,
here, is the quanti
nd . is
g 3. Floyd Steinbe
3/1
III. RELA
iffusion Halfto
using the secrevert the two in
nfidential imhe pixel repreeir size, shaphe half toninghe denser appack pixels in ascale. The spepresents the hteinberg dithevisited and chrors to its neid yet. Floyd
quantification g pixels shows flow chart is
teinberg dithequations (1) apixels.
255 0
, 2
. , ,
ified error at lused to determ
erg diffusion matr
pix
7
16
5/16
ATED WORKS
one Technique
et image into tnput images,
mage into hesentation in pe and the dg process reppearance of tha particular arparser of thehigh degree oering processhecked with tighboring pixd Steinberg residuals can
wn in Fig.3 a given in Fig.4
ering process and (2) here
,
(1)
255, , 12128
(2)
location (i, j), mine a pixel v
rix of distributing
xels.[1]
7/16
1/16
S
e
the input imagone secret imhalftone equthe space eac
distance betwpresents the dhe black pixe
rea represents e black pixelof grayscale. F is used. Hethreshold valu
xels that shoudiffusion ma
n be distributeand Floyd–St4.
can be descr128 is the th
, , 128
, 128
28
value to be 0 o
g the error to neig
ges it is mage and uivalent. ch pixel een the
different els. The the low ls in a For half re each ue then
uld have atrix of d to the teinberg
ribed by hreshold
or 255,
ghboring
to is firsthrin sub
neifrarigdowin eacneipixneiEx
Grays
Pixel
Fig. 4. Flow
Follow
halftone pixel128.From thest pixel whicreshold value.
the place obtracting the v
The resighborhood p
actional to theght down diagwn diagonal. the matrix. Tch column. Foighboring pixxels. The thighboring pix
xample is discu
+
scale
w chart of the Flo
ing is an examl. As already d
e figure (Fig 5ch is 159, iHence it is
of 159, thenvalue 159 by 2sultant is -96
pixel by the me right next pgonal,5/16 to Repeat the pr
The distributioor eg., the firsels. The seconhird pixel rxels and so onussed in the fi
(a)
Error Diffusion
Halft
Pixel
oyd–Steinberg dit
mple for convediscussed the 5) each pixel it should be 128 , replace
n evaluate th255 according6, now distribumatrix given pixel,1/16 of its down pixe
rocess to meeton of error difst pixel residund pixel residuresidual distrn till every piig.5.
(
Thresh
one
thering process.[1
erting the inputhreshold valis processed,
compared w255 as halfto
he error resig to equation (ute the residuin fig.3. 7/1the fractiona
el and 3/16 tot or visit all thffers in each
ual distributedual distributedributed to tixel is met, s
(b)
hold
1]
ut image ue taken take the
with the ne value dual by 2) .
ual to the 6 of the
al to the o its left he pixels row and
d to three d to four the two ee fig.3.
-
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3795
Fig.
repre
visit
outpreprblacbina
Cs
5 Floyd’s Stein
esented in pixel
ting the second pi
In this put share imresent the prock pixels. Eacary image wit
Fig.6 Emb
Floyd–Stei
Floyd–Steian
Convert to Cshifting coef
Modifyin
(c)
nberg Dithering pr
(b) resultant after
ixels(d) resultant
IV. PROPO
proposed sysmages are haoperty of the ch Pixel in theth only black a
[Input image
Share Image
bedding Phase of
inberg Half
inberg Halfd extra conf
Get shifting
CMY and apfficient for
ng Diffusion
…
rocess an exampl
r visiting the first
after meeting all
OSED SYSTE
stem, the inpualftone imageimages by va
e multi tone iand white pixe
e1] and [input
e A Share Im
the Shifting Coe
f toning of In
f toning of sfidential im
g coefficien
pply Pixel swextra confid
n and Pixel
(d)
le [1](a) Image
t pixel (c) resulta
the pixels.[1]
EM
ut cover images. Halftone arying the denmage is convel.
t image 2]
mage B
fficient Method
nput Image
secret imagemage
nt
wapping widential Imag
Swapping
ant after
ges and images
nsity of verted to
alsshodif
concontheimtheconcon
coethetheswdep
2.
imto getvalthetheuna
3.
anosepthetheWiimsepshivaltheto tCo
4.
decShcanrec
s
e
ith ge
Half toso retains theould also beffusion techniq
The twnfidential imanverting the ee shifting co
mage. Because e share imagnfidential imnstant and the
Thus thefficient techne algorithm she shifting co
wapped to diffupicted clearly
A. Shifting C
After cmage to the hal
convert and ttting the shiftlue is like a ke sender, canne shifting coeauthorized att
B. Stacking
Stackinother image. parately, no see receiver. We secret imageith no additio
mage can be viparately by anifting the othelue thus the exe message alsothe participan
oefficient Meth
C. Advantag
This shcrypting the
hifting coefficnnot be recocovering the e
oning reduces e image qualie converted inque.
wo input imaage are convextra confidenefficient valurevealing sec
ges together mage, the firse second sharehat certain unnique. After ghifts the seconoefficient valuse the secret in the fig.6.
Coefficient
converting inplftone techniqthen undergo
fting coefficiekey unless thenot recover thefficient valuetacks.
ng is the proceIf the two
ecret image caWhereas by sta
e can be reveonal computaewed in huma
ny tools. Also er share to rigxtra confidento promotes th
nt or receiver.Thod is illustra
ge
hifting coefficishare imag
cient key valvered. Therextra confident
the size of thity. The multnto half tone
ages, secret iverted into hntial image itue to obtain tcret image is whereas for
st share image has to be shifnit is given a
getting the shifnd share to N/lue. Further image and th
put image A, que the extra c
the process oent value. Thie receiver gethe extra confie is maintaine
ess of superimo share imagan be revealed
acking both thealed to the pation has beean visual systby keeping th
ght by using thtial data whichhe authenticatiThe extractionted as a flow d
ient act as a kes, hence wlue the extrafore it provitial data for au
he original imti toned inpu
ed by using t
image and thalftone imaget is necessarythe extra consimply stackrevealing th
ge has to befted to certainas a value in fting coefficie/2 units in adthe pixel h
he complete pr
input image Bconfidential imof pixel swapis shifting cos this key validential imageed as secret t
mposing one imges have bed to the partiche share imagarticipant or ren made. Thtem and not dehe one share fihe shifting coh holds the lifion has been n phase of the diagram in fig
key for encrypwithout knowa confidentiaides high secuthentication.
mage and ut image the error
he extra e, while
y to give nfidential ing both he extra e placed n units.
shifting ent value dition to as been rocess is
B, secret mage has pping by oefficient lue from e. Hence to avoid
mage on en kept cipant or ges, thus receiver.
he secret ecrypted
fixed and oefficient fetime of revealed Shifting
g.7.
pting and wing the al image curity in
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3796
Share Image A Share Image B
Fig 7. Extraction phase of the Shifting Coefficient Method
V. PERFORMANCE PARAMETER
To evaluate the performance of the proposed system, it is necessary to calculate the accurate rate of images used in this system (i.e.) the accurate rates of stacking result of original cover images and share images generated by the algorithm. The accurate rates of black secret area and white secret area are
represented as ARB and ARW which can be obtained by the following equations (3) and (4).
| |
| | (3)
| |
| | (4)
Where SR represents the stacking result of share images, SI represents secret image, symbol ‘0’ (zero) denotes black pixels and symbol ‘1’ (one) denotes the white pixels. For white secret region, this method converts the stacking result to as white as possible in order to increase the revealing contrast. On the other side, for the black secret region, this method converts the stacking result to as black as possible in order to increase the accurate. Hence, the difference between the white secret region and the black secret region is observed.
VI. RESULTS AND DISCUSSIONS
The following is the experimental results obtained from the proposed method of Visual Secret Sharing Scheme. fig.8 is the basic input images Baboon and Lena which are ready to be processed. Fig.9 holds the Half toned images of Baboon and Lena. The Secret image holds the secret message of “meet me at Richie park” fig .10 (a) and Extra Confidential Image holds the name “John” fig 10(b).Finally the fig.11are the share images which are to be sent to the receiver or participant. Fig.12.(a) is the Revealed Secret Image and Revealed Extra Confidential Image by Shifting Coefficient is obtained fig 12(b).
(a) (b)
Fig.8. Iinput images (a) Baboon (b)Lena
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3797
(a)
(b)
Fig.9. Halftoned Images (a) Baboon (b)Lena
(a) (b)
Fig.10. Images (a) Secret Image (b) Extra Confidential Image
(a) (b)
Fig.11. Share Images (a) Baboon (b) Lena
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3798
(a) (b)
Fig.12. Images (a) Revealed Secret Image (b) Revealed Extra Confidential Image by Shifting Coefficient
The accurate rate of the different main secret images and extra confidential images are calculated by the formula given in equation (4) and (5) and its result is given separately for the black pixels and white pixels as well called the ARb and ARw for four different set of secret images and extra confidential images in the following Table I. and its corresponding graphical representation for four trials is given in the fig. 13.depicts the accurate rate for black and white pixels for different secret images and extra confidential images.
TABLE I . ACCURATE RATE OF THE DIFFERENT SECRETS
IMAGE AND EXTRA CONFIDENTIAL IMAGES ARB ARw
Main Secret 1 0.8912 0.6934 Extra Confidential 1 0.8722 0.3155 Main Secret 2 0.9065 0.7219 Extra Confidential 2 0.9041 0.3388 Main Secret 3 0.9076 0.8495 Extra Confidential 3 0.8719 0.3865 Main Secret 4 0.9139 0.8634 Extra Confidential 4 0.8890 0.3989
Fig.13. graphical chart for the readings taken as accurate rates fro
m
the experiment (table I)
VII. CONCLUSION
This paper generates a secure color visual secret sharing scheme in which a secret image has been hidden into two other meaningful cover images without the pixel expansion and also embeds an extra confidential data for authentication by using the shifting coefficient method in order to provide more security. The receiver or participant who receives the two share
images can place one on another image to reveal the secret
image and to reveal the extra confidential image the shifting coefficient is needed to shift it with N/2 units. Unless the receiver is aware of the shifting coefficient cannot reveal the extra confidential image. Thus this method provides more security with key like structure in transmitting of the images across internet.
REFERENCES
[1] Der-Chyuan Lou, Hong-Hao Chen, Hsien-Chu Wu, Chwei-Shyong Tsai, “A novel authenticable color visual secret sharing scheme using non expanded meaningful shares”, Elsevier on Displays,vol.32,pp.118-134,2011
[2] Y.-F.Chang,J.-B.Feng,,C.-S.Tsai,Y.-P.Chu,H.C.Syu, “New data hiding scheme using pixel swapping halftone images” The Imaging Science Journal, vol 56,pp no.279 -290, 2008.
[3] H.C. Wu, H.C. Wang, R.W. Yu, “Color visual cryptography scheme using meaningful shares”, Eighth International Conference on Intelligent System Design and Applications vol. 3 pp. 173–178, 2008.
[4] S.J. Shyu,” Image encryption by random grids”, Pattern Recognition vol .40 no.3 pp.1014–1031, 2007
[5] Du-Shiau Tsai , Gwoboa Horng , Tzung-Her Chen c, Yao-Te Huang “ A novel secret image sharing scheme for true-color images with size constraint” Information Sciences vol. 179 pp. 3247–3254,2009. 0
0.2
0.4
0.6
0.8
1
Trial 1 Trail 2 Trail 3 Trail 4
Arb‐ Secret
Arw‐secret
Arb‐extra conf
Arw‐extra conf
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3799
1. M.John Justin received the B.E degree in Computer Science and Engineering from the Anna University, Chennai, India, in 2010,and pursuing his M.Tech degree in Software Engineering in Karunya University, Coimbatore ,India .His research interests include image processing, software engineering.
2. S.Manimurugan received the B.E. degree in Computer Science and Engineering from the Anna University, Chennai, India, in 2005, and the M.E. degree in Computer Science and Engineering in 2007. He is currently pursuing the Ph.D. degree in Computer Science and Engineering in Anna University, Coimbatore, India. His current research interests are in Image Processing, Information Security.
3. B.Alagendran received the B.E degree in Computer Science and Engineering from the Anna University, Chennai, India, in 2010, and pursuing his M.Tech degree in Software Engineering in Karunya University, Coimbatore, India. His research interests include image processing, software engineering, data mining.
John Justin M et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3793-3800
3800