Most of the image secret sharing schemes employ linear secret sharing such as Shamir's secret sharing scheme. Linear secret sharing threshold schemes are vulnerable to cheating problem (Tompa-Woll attack), where a participant can submit a false share and only he will be able to obtain the correct secret. Every Linear (k,n) threshold schemes are equivalent to some Maximum distance separable (MDS) codes. Finding more MDS linear codes is difficult and therefore finding more linear threshold schemes is not easy. In 1996, A.Renvall and C. Ding proposed a non-linear secret sharing scheme based on quadratic forms. In 2001 Pieprzyk and Zhang proposed a non linear scheme based on highly non linear balanced Boolean function. Even though work on nonlinear secret sharing schemes has been done on numbers, no significant work on images has been done so far. In this paper, concept of non-linear secret sharing scheme is extended to gray scale images. Experimental results concluded that non linear secret sharing can be applied for secret image sharing. It resists the Tompa-Woll attack and also able to retrieve the correct secret image, even if some of the shares are modified by a cheater.
cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@3994ca9b ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@5781a3a5 Through org.apache.xalan.xsltc.dom.DOMAdapter@1ed285; Conference Code:89225
A. Nandakumar, Amritha, P. P., Dr. Lakshmy K. V., and Talluri, V. S., “Non linear secret sharing for gray scale images”, Procedia Engineering, vol. 30. Coimbatore, pp. 945-952, 2012.