140 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010quality can be decoded from the same set <strong>of</strong> shares. Ifonly the stack<strong>in</strong>g operation is allowed (i.e. nocomputations), then our scheme recovers the orig<strong>in</strong>alvisual cryptographic quality. If the XOR operation isprovided (<strong>in</strong>stead <strong>of</strong> the OR operation <strong>of</strong> stack<strong>in</strong>g), thenwe can fully restore the orig<strong>in</strong>al quality image.B. For Colored Images (Halftone-based Grayscale andColor Visual Cryptography)Digital halfton<strong>in</strong>g has been extensively used <strong>in</strong>pr<strong>in</strong>t<strong>in</strong>g applications where it has been proved to be veryeffective. For visual cryptography, the use <strong>of</strong> digital halfton<strong>in</strong>g is for the purpose <strong>of</strong> convert<strong>in</strong>g the grayscaleimage <strong>in</strong>to a monochrome image. Once we have a b<strong>in</strong>aryimage, then the orig<strong>in</strong>al visual cryptography techniquecan be applied. However, the concomitant loss <strong>in</strong> qualityis unavoidable <strong>in</strong> this case.For color images, there are two alternatives forapply<strong>in</strong>g digital halfton<strong>in</strong>g. One is to split the color image<strong>in</strong>to channels <strong>of</strong> cyan, magenta and yellow. Then eachchannel is treated as a grayscale image to whichhalfton<strong>in</strong>g and visual cryptography are applied<strong>in</strong>dependently. After the monochrome shares aregenerated for each channel, channels are comb<strong>in</strong>edseparately to create the color shares. This is the approachpresented <strong>in</strong> [9]. The alternative approach would be todirectly apply color halfton<strong>in</strong>g, then perform theseparation <strong>in</strong>to color channels followed by the application<strong>of</strong> visual cryptography to each channel <strong>in</strong>dependently.Actually, these two approaches lead to the same resultsf<strong>in</strong>ally. There are many mature halfton<strong>in</strong>g techniquesavailable for selection like dispersed-dot dither<strong>in</strong>g,clustered-dot dither<strong>in</strong>g and error diffusion techniques.Halfton<strong>in</strong>g based visual cryptographic scheme can besummarized as follows:a) Encryption: This stage is for the creation <strong>of</strong>shares. This can be further divided <strong>in</strong>to the follow<strong>in</strong>gsteps:i. Color halfton<strong>in</strong>g: Standard algorithms such as theones described <strong>in</strong> [2], [13] and [14] can be usedfor this step. One could do the color channelsplitt<strong>in</strong>g first and then do the grayscale halfton<strong>in</strong>gfor each channel:ii.Or one could do color halfton<strong>in</strong>g first followed bythe splitt<strong>in</strong>g:Creation <strong>of</strong> shares: Consider<strong>in</strong>g the case <strong>of</strong>(2,2)-VCS, the steps areb) Decryption: This stage is for the reconstruction<strong>of</strong> the orig<strong>in</strong>al secret image. This can be further divided<strong>in</strong>to the follow<strong>in</strong>g steps:i. Stack<strong>in</strong>g <strong>of</strong> shares: The follow<strong>in</strong>g stack<strong>in</strong>g (OR)operation needs to be performed:ii. Subsampl<strong>in</strong>g for reconstruction: Theseoperations need to be performed where everyblock <strong>of</strong> f our pixels is sub-sampled <strong>in</strong>to onepixel <strong>of</strong> the f<strong>in</strong>al image. This step is optional andshould be used only with the XOR recoverydescribed <strong>in</strong> Section III-B.1 to achieve betterquality.Then, for every 2*2 block B(i; j) <strong>of</strong> I, whereIt is clear that our technique, though <strong>in</strong>dependentlydeveloped, is quite similar <strong>in</strong> spirit to the one described <strong>in</strong>[9]. So both share the same drawback that digitalhalfton<strong>in</strong>g always leads to permanent loss <strong>of</strong> <strong>in</strong>formationwhich means that the orig<strong>in</strong>al image can never beperfectly restored. Inverse halfton<strong>in</strong>g is a possiblesolution that can attempt to recover the image. The bestresults can obta<strong>in</strong> a restoration quality <strong>of</strong> 30 dB measured<strong>in</strong> PSNR, which is quite good. But this is not sufficientfor applications which require that the orig<strong>in</strong>al image befaithfully recovered. In fact, <strong>in</strong> all other cryptographictechniques, it is taken for granted that the decryption <strong>of</strong> aciphertext perfectly recovers the pla<strong>in</strong>text. But visualcryptography has been a glar<strong>in</strong>g exception so far.© 2010 ACADEMY PUBLISHER
JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010 141VI. CONCLUSIONIn this paper, I have extended traditional visualcryptography by employ<strong>in</strong>g new schemes whichovercome its limitations. I propose a technique forgrayscale and color visual cryptography. Our <strong>in</strong>sight isthat the OR operation <strong>in</strong> the traditional visualcryptography can be replaced by the XOR operation <strong>in</strong>order to allow for lossless decryption. However, there aresome practical issues that need careful consideration.First, the transparencies should be precisely aligned <strong>in</strong>order to obta<strong>in</strong> a clear reconstruction. Secondly, there isusually some unavoidable noise <strong>in</strong>troduced dur<strong>in</strong>g thepr<strong>in</strong>t<strong>in</strong>g process. Thirdly, the stack<strong>in</strong>g method can onlysimulate the OR operation which always leads to a loss <strong>in</strong>contrast. Proper alignment is absolutely essential whensuperimpos<strong>in</strong>g the shares. In real experiments, we havefound that obta<strong>in</strong><strong>in</strong>g perfect alignment is alwaystroublesome. As visual cryptographic schemes operate atthe pixel levels, each pixel on one share must be matchedcorrectly with the correspond<strong>in</strong>g pixel on the other share.Superimpos<strong>in</strong>g the shares with even a slight shift <strong>in</strong>alignment results <strong>in</strong> a drastic degradation <strong>in</strong> the quality <strong>of</strong>the reconstructed image. In the worst case, even a s<strong>in</strong>glepixel shift can render the secret image totally <strong>in</strong>visible.This alignment problem can be resolved if the boundary<strong>of</strong> each share is clearly marked which can act as guidesfor the alignment.REFERENCES[1] M. Naor and A. Shamir, “Visual cryptography,” <strong>in</strong> Advances<strong>in</strong> Cryptology -EUROCRYPT’94, A. D. Santis., Ed., vol.950. Spr<strong>in</strong>ger-Verlag, 1995, pp. 1–12.[2] H. R. Kang, Digital Color Halfton<strong>in</strong>g, ser. SPIE/IEE Serieson Imag<strong>in</strong>g Science and Eng<strong>in</strong>eer<strong>in</strong>g, E. R. Dougherty,Ed.Bell<strong>in</strong>gham, Wash<strong>in</strong>gton USA and New York:Copublished by SPIE Optical Eng<strong>in</strong>eer<strong>in</strong>g Press and IEEEPress, 1999.[3] M. Naor and A. Shamir, “Visual cryptography 2: Improv<strong>in</strong>gthe contrast via the cover base,” 1996, a prelim<strong>in</strong>aryversionappears <strong>in</strong> “Security Protocols”, M. Lomas ed. Vol.1189 <strong>of</strong> Lecture Notes <strong>in</strong> Compute Science, Spr<strong>in</strong>ger-Verlag, Berl<strong>in</strong>,pp.197-202, 1997.[4] A. D. S. G. Ateniese, C. Blundo and D. R. St<strong>in</strong>son,“Constructions and bounds for visual cryptography,” <strong>in</strong> 23 rdInternational Colloquium on Automata, Languages andProgramm<strong>in</strong>g, ser. Lecture Notes <strong>in</strong> Computer Science, F.M. auf der Heide and B. Monien, Eds., vol. 1099. Berl<strong>in</strong>:Spr<strong>in</strong>ger-Verlag, 1996, pp. 416–428.[5] C. Blundo, P. D’Arco, A. D. Snatis, and D. R. St<strong>in</strong>son,“Contrast optimal threshold visual cryptography schemes,”SIAM <strong>Journal</strong> on Discrete Mathematics, available at:http://citeseer.nj.nec.com/blundo98contrast.html, vol. 16,no. 2, pp. 224–261, April 1998.[6] G. Ateniese, C. Blundo, A. D. Santis, and D. St<strong>in</strong>son,“Extended schemes for visual cryptography,” TheoreticalComputerScience, vol. 250, pp. 143–161, 2001.[7] Y. Desmedt and T. V. Le, “Moire cryptography,” <strong>in</strong> the 7thACM Conference on Computer and CommunicationsSecurity’00, Athens, Greece, 2000.[8] V. Rijmen and B. Preneel, “Efficient color visual encryptionfor shared colors <strong>of</strong> benetton,” 1996, EUCRYPTO’96RumpSession. Availabe athttp://www.iacr/org/conferences/ec96/rump/preneel.ps.[9] Y. C. Hou, C. Y. Chang, and S. F. Tu, “Visual cryptographyfor color images based on halftone technology,”<strong>in</strong>International Conference on Information Systems,Analysis and Synthesis. World Multiconference onSystemics, Cyberneticsand Informatics. Image, Acoustic,Speech And Signal Process<strong>in</strong>g: Part II, 2001.[10] M. Naor and B. P<strong>in</strong>kas, “Visual authentication andidentification,” Lecture Notes <strong>in</strong> Computer Science, vol.1294, pp. 322–336, 1997. [Onl<strong>in</strong>e]. Available:citeseer.nj.nec.com/67294.html[11] Q. B. Sun, P. R. Feng, and R. Deng, <strong>in</strong> InternationalConference on Information Technology: Cod<strong>in</strong>g andComput<strong>in</strong>g (ITCC ’01), available at:http://dlib.computer.org/conferen/itcc/1062/pdf/10620065.pdf, Las Vegas, April 2001.[12] S.-S. Lee, J.-C. Na, S.-W. Sohn, C. Park, D.-H. Seo, andS.-J. Kim, “Visual cryptography based on an <strong>in</strong>terferometricencryption technique,” ETRI <strong>Journal</strong>, vol. 24, pp. 373–380,2002, available at http://etrij.etri.re.kr/etrij/pdfdata/24-05-05.pdf.Supriya A. K<strong>in</strong>ger was born <strong>in</strong> Haryana,India on 15 th july 1982. She did herMaster’s <strong>in</strong> technology <strong>in</strong> field <strong>of</strong>computer science from YMCA, Haryana<strong>in</strong> year 2005, India and Bachelor’s <strong>in</strong>technology <strong>in</strong> Computer Science fromKU, Haryana, India. In year2003.Currently she is do<strong>in</strong>g research <strong>in</strong>field <strong>of</strong> S<strong>of</strong>tware Eng<strong>in</strong>eer<strong>in</strong>g(Component Based S<strong>of</strong>twareEng<strong>in</strong>eer<strong>in</strong>g).She has more than 5 Years <strong>of</strong> experience <strong>in</strong> teach<strong>in</strong>g andresearch. She has attended and organized a number <strong>of</strong>workshops and conferences. She hosted a conference ASET-2006 at CIET and acted as convener <strong>in</strong> it. She has presentednumber <strong>of</strong> papers <strong>in</strong> national and <strong>in</strong>ternational conferences <strong>of</strong>repute on the topics <strong>of</strong> web crawlers, Component baseds<strong>of</strong>tware Eng<strong>in</strong>eer<strong>in</strong>g, Information Security and Networks.Currently she is Work<strong>in</strong>g with Chitkara Institute <strong>of</strong> Eng<strong>in</strong>ner<strong>in</strong>gand Technology, Punjab, India as Senior Lecturer. Earlier shehas worked at Institute <strong>of</strong> Eng<strong>in</strong>eer<strong>in</strong>g and Technology. She islife member <strong>of</strong> ISTE© 2010 ACADEMY PUBLISHER