Hierarchical Implementation of RKO Technique for Visual Cryptography

Abstract
Authors
Keywords
Conclusion
References

This paper describes the concept of hierarchical visual cryptography using RKO technique. The key idea behind hierarchical RKO is to encrypt the secret information in number of levels. As the number of levels in hierarchical visual cryptography increases, the secrecy of data tends to increase. The shares generated out of Hierarchical visual cryptography are found to be random giving no information. The RKO technique generates two shares of the original image: one random share and the other key share. These shares are further divided into four more shares using the same RKO technique. From these four shares two final shares are generated. The original secret image can be recovered from the two shares simply by XORing the two shares without any loss of image quality. If any shares other than final shares are XORed it won’t reveal the original image.

Published In : IJCAT Journal Volume 1, Issue 4

Date of Publication : 31 May 2014

Pages : 37 - 41

Figures : 02

Tables : 03

Publication Link : Hierarchical Implementation of RKO Technique for Visual Cryptography

Ms. Moushmee Kuri : has received B.E.(Computer Engg) from Goa University in 1998, pursuing M. E. Compter Engg from Thadomal Shahani College of Engineering, Bandra, Mumbai, Working as Assistant Professor in Computer Dept. at Watumull Institute of Electronics Engg and Computer Technology., Worli Mumbai. She has more than 10 years of experience in teaching. Has published two papers in the field of Visual Cryptography. Her areas of interest are system Security, system programming and Image Processing.

Dr. Tanuja Sarode : has Received Bsc.(Mathematics) from Mumbai University in 1996, Bsc.Tech.(Computer Technology) from Mumbai University in 1999, M.E. (Computer Engineering) from Mumbai University in 2004, Ph.D. from Mukesh Patel School of Technology , Management and Engineering, SVKM’s NMIMS University, Vile-Parle (W), Mumbai, INDIA. She has more than 14 years of experience in teaching. Currently working as Associate Professor in Dept. of Computer Engineering at Thadomal Shahani Engineering College, Mumbai. She is life member of IETE, member of International Association of Engineers (IAENG) and International Association of Computer Science and Information Technology (IACSIT), Singapore. Her areas of interest are Image Processing, Signal Processing and Computer Graphics. She has 55 papers in National /International Conferences/journal to her credit.

Visual Cryptography

Hierarchical

RKO technique

Color image

The proposed implementation has the following merits (a) The original secret image can be retrieved in totality (b) There is no pixel expansion and hence storage requirement per random share is same as original image (c) Key management is not an issue since there are no secret keys involved as encryption is carried out based on RGB value of the pixels (d) the scheme is robust to withstand brute force attacks. (e) the quality of the image recovered is same as the original image. (f) The same technique can be used on gray scale images also without any change in the algorithm[16].(e) Due to the hierarchical implementation, the randomness in the shares increases so its impossible to guess the original image by looking at any of the shares. (f) No intermediate shares can reveal the original image when combined.

[1] M. Naor and A. Shamir, “Visual cryptography,” in Proc. EUROCRYPT’ 94, Berlin, Germany, 1995, vol. 950, pp. 1–12, Springer-Verlag, LNCS

[2] Jaya, Siddharth Malik, Abhinav Aggarwal, Anjali Sardana, “ Novel Authentication System Using Visual Cryptography”, in 2011 World Congress on Information and Communication Technologies.

[3] F. Liu1, C.K. Wu X.J. Lin , “Colour Visual Cryptography Schemes”, IET Information Security, vol. 2, No. 4, pp 151-165, 2008.

[4] Y. C. Hou, “Visual cryptography for color images,” Pattern Recognition, vol. 36, pp. 1619-1629, 2003.

[5] Siddharth Malik, Anjali Sardana, Jaya “A Keyless Approach to Image Encryption”, 2012 International Conference on Communication Systems and Network Technologies

[6] L. W. Hawkes, A. Yasinsac and C. Cline, "An Application of Visual Cryptography to Financial Documents," Technical report TR001001,Florida State University, 2000.

[7] George Abboud, Jeffrey Marean, Roman V. Yampolskiy, “Steganography and Visual Cryptography in Computer Forensics”, in 2010 Fifth International Workshop on Systematic Approaches to Digital Forensic Engineering

[8] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979.

[9] H.-C. Wu, C.-C. Chang, “Sharing Visual Multi-Secrets Using Circle Shares”, Comput. Stand. Interfaces 134 (28) ,pp. 123–135, (2005). [10] Chin-Chen Chang, Jun-Chou Chuang, Pei-Yu Lin , “Sharing A Secret Two-Tone Image In Two Gray-Level Images”, Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS'05), 2005.

[11] Bhavani, A. B. "Cross-site Scripting Attacks on Android WebView." arXiv preprint arXiv:1304.7451 (2013). [12] Tzung-Her Chen, Kai-Hsiang Tsao, and Kuo-Chen Wei, “Multiple-Image Encryption By Rotating Random Grids”, Eighth International Conference on Intelligent Systems Design and Applications, pp. 252-256 , 2008.

[13] Du-Shiau Tsai , Gwoboa Horng , Tzung-Her Chen , Yao-Te Huang , “A Novel Secret Image Sharing Scheme For True-Color Images With Size Constraint”, Information Sciences 179 3247–3254 Elsevier, 2009.

[14] R. Lukac, K.N. Plataniotis “Bit-level based secret sharing for image encryption”, The Journal of Pattern Recognition Society, 2005.

[15] C.C. Chang, T.-X. Yu,” Sharing a secret gray image in multiple images”, in: Proceedings of First International Symposium on Cyber orlds, 2002, pp.230–240.

[16] Pallavi V. Chavan and Dr. Mohammad Atique “Design of Hierarchical Visual Cryptography” 2012 Nirma University International Conference on engineering, nuicone-2012, 06-08december, 2012, IEE 2013.

[17] Ms. Moushmee Kuri, Dr. Tanuja Sarode, “RKO Technique for Color Visual Cryptography”, in : IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. X (Mar-Apr. 2014), PP 89-93