Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
Hidenori Kuwakado, Hatsukazu Tanaka · Institutional Repositories DataBase (IRDB) · 2002
SUM M ARYA visual secret sharing scheme (VSSS) is one of secret sharing schemes for images.Droste showed the method for constructing VSSS ba.sed on ba.sis matrices whrn;e contrast was high.Koga, Iwamoto, and Yamamoto also proposed the method for constructing a lattice-based VSSS and its polynomial representatioll.It is known that many good VSSSs are not in the class of lattice-based VSSSs.In t his paper, we show t he welldefined polynomial representation of a VSSS based on permuting different matrices for black-white images.The necessary and sufficient condition of the existence of a VSSS based on permuting different matrices can be obtained from the proposed polynomial representation.This condition is useful for constructing a good VSSS.We also point out t hat without additional data, it is possible to achieve member verification by using a VSSS.Using the pro)WSed polynomial representation, the probability of detecting a cheater is analyzed.