International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 7, No. 7, 8 Jun. 2015
Cover page and Table of Contents: PDF (size: 710KB)
(N, N) Secret Color Image Sharing Scheme with Dynamic Group
Full Text (PDF, 710KB), PP.46-52
Views: 0 Downloads: 0
Author(s)
Index Terms
Secret sharing Scheme, Visual cryptography, meaningless shares, pixel expansion, dynamic secret sharing, secure information sharing
Abstract
In recent years, secure information sharing has become a top requirement for many applications such as banking and military. Secret Sharing is an effective method to improve security of data. Secret Sharing helps to avoid storing data at a single point through dividing and distributing “shares” of secrets and recovering it later with no loss of original quality. This paper proposes a new Secret Sharing scheme for secure transmission of color images. The key features of this scheme are better visual quality of the recovered image with no pixel expansion, eliminating half toning of color images, eliminating the need for code book to decrypt images since reconstruction is done through XOR ing of all images and non-requirement of regeneration of shares for addition or deletion of users leading to less computational complexity. Besides these advantages, this scheme also helps to renew shares periodically and is highly beneficial in applications where data has to be stored securely in a database.
Cite This Paper
Mohamed Fathimal. P, Arockia Jansi Rani .P, "(N, N) Secret Color Image Sharing Scheme with Dynamic Group", International Journal of Computer Network and Information Security(IJCNIS), vol.7, no.7, pp.46-52, 2015. DOI:10.5815/ijcnis.2015.07.06
Reference
[1]Naor.M and Shamir.A, “Visual cryptography,” in Proc. Advances inCryptography (EUROCRYPT’94), vol. 950, LNCS, pp. 1–12,1995.
[2]Blakely G.R. “Safeguarding cryptographic keys”, Proceedings AFIPS 1979 National Computer Conference, vol. 48, NewYork, USA, 4–7. p. 313–7,1979.
[3]Shamir A,” How to share a secret”, Communication of the ACM 22(11):612–3,1979.
[4]Chih-Ching Thien, Ja-Chen Lin, “Secret image sharing”, Computers & Graphics 26 765–770, 2002.
[5]Guiqiang Chen, Jianjun Liu, Liqin Wang,” Color Image Sharing Method Based on Lagrange’s Interpolating Polynomial”, Health Information Science,Lecture Notes in Computer Science Volume 7231pp 63-75, 2012 .
[6]Han-Yu Lin*, and Yi-Shiung Yeh , Dynamic Multi-Secret Sharing Scheme , Int. J. Contemp. Math. Sciences, Vol. 3, 37 - 42 , 2008.
[7]Sian-Jheng Lin And Wei-Ho Chung , ”A Probabilistic Model Of Visual Cryptography (t,n) Scheme with Dynamic Group”, IEEE Transactions On Information Forensics And Security, Vol. 7, No. 1, 197, February 2012.
[8]Z.Zhou, G.R.Arce, and G.Di Crescenzo, “Halftone visual cryptography”, IEEE Tans. On Image Processing, vol.15, No.8,pp. 2441-2453, August 2006.
[9]Robert Ulichney, “The void-and-cluster method for dither array generation”, IS&T/SPIE Symposium on Electronic Imaging and Science, San Jose, CA, 1993, vol.1913, pp.332-343.
[10]Tsung-Lieh Lin , Shi-Jinn Horng a, Kai-Hui Lee , Pei- LingChiu, Tzong-Wann Kao, Yuan-Hsin Chen, Ray-Shine Run, Jui-Lin Lai,Rong- Jian Chen, “A novel visual secret sharing scheme for multiple Secrets without pixel expansion”, Pattern Recognition,2010.
[11]InKoo Kang, Gonzalo R. Arce, Heung-Kyu Lee, “Color extended visual cryptography using error diffusion”, IEEE Transactions On Image Processing, Vol. 20, No. 1, January 2011.
[12]Aarti, Pushpendra K Rajput,”An EVCS for Color Images with Real Size Image Recovery and Ideal Contrast Using Bit Plane Encoding” I.J.Computer Network and Information Security, 2014, 2, 54-60
[13]Mohamed Fathimal.P,Dr.P.Arockia Jansi Rani, “Bidirectional Serpentine Scan Based Error Diffusion Technique for Color Image Visual Cryptography”, International Journal of Science, Engineering and Technology Research,2014
[14]Mohamed Fathimal.P,Dr.P.Arockia Jansi Rani, “K out of N Secret Sharing Scheme for Gray and Color Images”, IEEE International Conference on Electrical, Computer and Communication Tchnologies, March 2015.