An analytic construction of the visual secret sharing scheme for color images

This paper proposes a new construction of the visual secret sharing scheme for the (n, n)-threshold access structure applicable to color images. The c onstruction uses matrices with n rows that can be identified with homogeneo us polynomials of degree n. It is shown that, if we find a set of homogeneo us polynomials of degree n satisfying a certain system of simultaneous part ial differential equations, we can construct a visual secret sharing scheme for the (n,n)-threshold access structure by using the matrices correspondi ng to the homogeneous polynomials. The construction is easily extended to t he cases of the (t,n)-threshold access structure and more general access st ructures.