• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Visual cryptography scheme for color images
 

Visual cryptography scheme for color images

on

  • 649 views

 

Statistics

Views

Total Views
649
Views on SlideShare
649
Embed Views
0

Actions

Likes
0
Downloads
20
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Visual cryptography scheme for color images Visual cryptography scheme for color images Document Transcript

    • International Journal of Computer and Technology (IJCET), ISSN 0976 – 6367(Print),International Journal of Computer Engineering EngineeringISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEMEand Technology (IJCET), ISSN 0976 – 6367(Print)ISSN 0976 – 6375(Online) Volume 1 IJCETNumber 1, May - June (2010), pp. 207-212 ©IAEME© IAEME, http://www.iaeme.com/ijcet.html VISUAL CRYPTOGRAPHY SCHEME FOR COLOR IMAGES B.Saichandana Assistant Professor Department of Computer Science and Engineering GIT, GITAM University, Visakhapatnam Dr.K.srinivas Associate Professor Department of Computer Science and Engineering Pydah College of Engineering Dr. Reddi Kiran Kumar Assistant Professor Department of Computer Science Krishna University, MachilipatnamABSTRACT: Visual cryptography is a method for protecting image based secrets that has acomputation-free decoding process. In this paper, we propose a new visual cryptographyscheme for color images based on CMY model, half toning technique and the traditionalbinary image sharing scheme. The image shares generated by our method are transmittedto the destination through a network and the image is decrypted by stacking any twotransparencies. The image can be in any standard format. This scheme provides anefficient way to hide the natural image among different shares. Furthermore, the size ofthe shares and the implementation complexity do not depend on the number of colorsappearing in the secret image.I. INTRODUCTION: Data hiding and visual cryptography are used to introduce confidentiality andsecurity when visual data are transmitted through unsecured channels. Data hidingtechniques try to embed data in digital media and transmit it in an imperceptible way. Onthe other hand, in visual cryptography or visual secret sharing, the original input is shared 207
    • International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print),ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEMEbetween a set of participants by a secret image holder. Based on the sharing policy, onlyqualifies subsets of participants can recover the original input image. Visual cryptography [1] is a cryptographic technique which allows visualinformation (pictures, text, etc) to be encrypted in such a way that the decryption can beperformed by the human visual system without the aid of computers. The most traditionalvisual cryptography scheme is used for black and white images. Recently, some visualcryptography schemes for gray or color images have been proposed. In all the proposedschemes [2, 3, 4], if the number of colors in an image is large, the worse the resolution ofthe decrypted images. Two important factors are used to determine the efficiency of any visualcryptography scheme [5], namely: 1) the quality of the reconstructed image and 2) thepixel expansion factor (m). Any loss of information during the reconstruction phase leadsto the reduction in the quality of the recovered image. On the other hand pixel expansionrefers to the number of sub-pixels in the generated shares that represents a pixel of theoriginal input image. For bandwidth constrained communication channels it is desirableto keep ‘m’ as small as possible. For color images, reducing pixel expansion is ofparamount importance since they occupy more space and more bandwidth compared togrey scale and binary images.The paper is organized as follows: Section II presents the proposed scheme, Section IIIpresents the experimental results and finally section IV makes the conclusions.II PROPOSED SCHEME: The proposed color image sharing scheme is based on the CMY model, halftoning technique and the traditional binary image sharing scheme. Firstly, a chromatic image is decomposed into three monochromatic images intones of cyan, magenta and yellow. The purpose of using a color model is to facilitate thespecification of colors in some standard, generally accepted way. In essence, a colormodel is a specification of a coordinate system and a subspace within that system whereeach color is represented in a single point. The CMY color model is used in our method.This conversion is performed using the simple operation given in Figure 1. 208
    • International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print),ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME C 1 R M = 1 - G Y 1 B Figure 1 Conversion from RGB to CMY Secondly, these three monochromatic images (cyan, magenta and yellow) aretransformed into binary images by half toning technique. Halftone is a method to displayan image in black and white spots. In this paper, we use Floyd-Steinberg algorithm togenerate the halftone images.FLOYD AND STEINBERG ALGORITHM: Assume, g is the gray value of the image, which location is p(x,y).e is the difference between the computed value and correct value.b=0.w=255.t=128. ((b+w)/2)if g > t then print white; e=g-w;else print black; e=g-b;(3/8 * e) is added to p(x+1,y);(3/8 * e) is added to p(x,y+1);(1/4 * e) is added to p(x+1, y+1)Endif Thirdly, we consider every monochromatic image as a secret image and use thetraditional binary image sharing scheme to divide it into three secret shares with the samecolor, and then we can choose any three different colors of which to compose them intothree colored shares. We have used (2, 3) visual threshold scheme for natural images [6],for the generation of shares with the matrices shown in Figure 2. 011 101 110 M0 = 0 1 1 M1= 1 0 1 M2= 1 1 0 011 101 110 Figure 2 Matrices used in binary image sharing 209
    • International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print),ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME Finally, these shares are transmitted through a communication channel to thedestination. The original secret information will be visible by stacking any 2 or 3transparencies, but none secret information will be revealed by only one transparency. As stated in section I, the efficiency of any visual cryptography scheme dependson two factors ie; the quality of the reconstructed image and the pixel expansion factor‘m’. We used the Structural Similarity (SSIM) index [7] for measuring the qualitybetween two images. The SSIM index can be viewed as a quality measure of one of theimages being compared provided the other image is regarded as of perfect quality. Thequality measures are calculated between the original image, generated shares and therecovered image. In our proposed scheme, a) the size of the shares is equal to the size ofthe original input image, implies that no extra bandwidth is required for transmitting theshares through a communication channel and b) the generated shares perfectly recoverthe output image with SSIM index near to 1. These are the key advantages of our visualcryptography scheme.III EXPERIMENTAL RESULTS: This section presents the simulation results illustrating the performance of theproposed Visual cryptographic scheme. The test image employed here is the true colorimage “flower” with 290×290 pixels. The encryption and decryption algorithm areimplemented in Matlab 7.0 in core2duo of 2.66 GHz machine. a) original image b) halftone c) S1 (share 1) d) S2 (share 2) 210
    • International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print),ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME e) S3 (share 3) f ) S1+S2 f) S2+S3 g) S1+S3 h)S1+S2+S3 Figure 3 Simulation results for (2,3) scheme Figure 3(a) is an original chromatic image. The image is decomposed in to threemonochromatic images in tones of cyan, magenta and yellow. These three images aretransformed into binary images by half toning technique. If we compose those threemonochromatic images, we get figure 3(b). By using the binary image sharing scheme,we divide every monochromatic image into three secret shares with same color, and then,we can choose any three different colors of which to compose them into three coloredshares shown in figures 3(c), 3(d) and 3(e). The original information will be visible bystacking any 2 or 3 transparencies as shown in figures 3(e), 3(f), 3(g) and 3(h). Table 1 shows the quality measures that are calculated between the originalimage, generated shares and the recovered image by using the SSIM index. Image SSIM Index Original image 1 S1( share 1) 0.0041 S2 (share 2) 0.0032 S3 (share 3) 0.0036 S1+S2 0.88 S2+S3 0.89 S1+S3 0.87 S1+S2+S3 0.94 Table 1: SSIM index values for images in Figure 3 211
    • International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print),ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEMECONCLUSION: In this paper, we have presented a new kind of visual cryptography scheme basedon CMY model, half toning and binary secret sharing scheme. The advantages of theproposed method are its pixel expansion factor (the size of the share is same as the size ofthe original image) and its capability of perfect reconstruction of the secret image. Thiswork is an attempt to make a secured transfer of valuable images between two trustedparties. The confidentiality is maintained and the authentication can be checked by digitalsignatures. It can be shown that the proposed scheme do not depend on the number ofcolors appearing in the secret image.REFERENCES:[1] M.Naor and A Shamir, “Visual Cryptography”, Proceeding of Eurocrypt 94 LectureNotes in Computer Science, LNCS963,Berlin: Springer, 1994, pp1-11.[2] E.R.Verheul and H.C.A. Tilberg, “ Constructions and properties of k out of n visualsecret sharing schemes”, Designs, Codes and Cryptography 1997, 11(2): pp 179-196[3] M.Naor and A.shamir, “Visual cryptography II: Improving the contrast via the coverbase,” In Proc. of security protocols, international workshop 1996, Lecture notes inComputer Science No. 1189, Springer-Verlag, 1997, pp 69-74[4] V.Rijmen and B.Preneel, “Efficient color visual encryption for shared colors ofBenetton”, Eorucrypt ’96, Rump Session Berlin 1996[5] Mohsen Heidarinejad, Amirhossein Alamdar Yazdi and Konstantious N.Plataniotis,“Algebraic visual cryptography scheme for color images”, IEEE transactions 2008.[6] H.J.Kim and Y.Choi “A new visual cryptography using Natural images”, IEEEtransactions “, Symposium on circuits and systems 2005.[7] Z. Wang, A. C. Bovik, H. R. Sheikh and E. P. Simoncelli, "Image quality assessment:From error visibility to structural similarity," IEEE Transactions on Image Processing,vol. 13, no. 4, pp. 600-612, Apr. 2004. 212