A Novel Mathematical Model for (t, n)-Threshold Visual Cryptography Scheme

International Journal of Computer Trends and Technology (IJCTT)          
© 2014 by IJCTT Journal
Volume-12 Number-3
Year of Publication : 2014
Authors : B.Padhmavathi , Dr.P.Nirmal Kumar
DOI :  10.14445/22312803/IJCTT-V12P125


B.Padhmavathi , Dr.P.Nirmal Kumar."A Novel Mathematical Model for (t, n)-Threshold Visual Cryptography Scheme". International Journal of Computer Trends and Technology (IJCTT) V12(3):126-129, June 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
As technology is progressing and more and more personal data is digitized, there is even more need for data security today than there has ever been. Protecting this critical data in a secure way against the unauthorised access is an immensely difficult and complicated research problem. Within the cryptographic community, many attempts have been in this regard. In visual cryptography, secret sharing offers a similar scheme, where a secret S, encoded into an image is shared among a group of n members, each of them holds a portion of the secret as their secret shares. The secret can only be retrieved when a certain number of t members (where t ? n) combine their shares together. And while any combination with fewer than t shares have no extra information about the secret than 0 shares. This kind of secret sharing system is known as (t, n) - threshold scheme or t-out-of-n VC scheme. In this paper, we discuss various types of visual cryptographic schemes emphasizing on improving the efficiency and capacity of the original schemes. An analysis on the optimal contrast of the recovered secret, the robustness and security issues of technique is also presented. This paper attempts to develop a mathematical model based on interpolation for visual cryptography. Such a model using Lagrange’s formula is implemented and experimental results are verified.

[1] M. Naor and A. Shamir, “Visual cryptography”, Advances in cryptology Eurocrypt’94, pp.1-12, Springer Berlin Heidelberg, 1995.
[2] K.H. Lee and P.L. Chiu, “An Extended Visual Cryptography Algorithm for General Access Structures”, IEEE Transactions on Information Forensics and Security,vol.7,no.1, Taiwan.
[3] R. Ito, H. Kuwankada and H. Tanaka, “Image size invariant visual cryptography”, IEICE transactions on fundamentals of electronics, communications and computer sciences,vol.82, no.10,pp.2172-2177, 1999.
[4] S.J Lin and W.H Chung, “A Probabilistic model of (t,n) Visual Cryptography Scheme with Dynamic group”, IEEE transactions on information forensics and security, vol.7, no.1, February 2012.
[5] C.N Yang and T.S Chen “Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion”, Pattern recognition Letters, vol.26, no.2, pp.193-206, 2005.
[6] A Shamir, “How to share a secret”, Communications of the ACM, vol.22, no.11, pp.612-613, 1979.
[7] G. R. Blakley “Safe guarding Cryptographic Keys”, International Workshop on Managing Requirements Knowledge, pp. 313-313. IEEE Computer Society, 1899.
[8] C.C. Chang, J.C. Chuang, P.Y. 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. vol. 2, pp.300-304.
[9] S. J. Shyu, S. Y. Huanga,Y. K. Lee, R. Z. Wang, and K. Chen, “Sharing multiple secrets in visual cryptography”, Pattern Recognition, vol. 40, no 12, pp.3633 - 3651, 2007.

Threshold scheme, Visual Cryptography, Mathematical Model, Lagrange Interpolation.