Secret image sharing scheme based on bivariate polynomial

Most of secret image sharing schemes are follow the idea of classic Shamir scheme, namely the (k,n) threshold scheme based on one-variable polynomial. Which schemes succeed much advantages of the Shamir scheme, such as implentment easily, both have features of Perfect and Ideal and so on. But those schemes regard images as data stream, and not adequately consider the matrix characteristics of the digital image. In view of this situation, this paper proposed a new secret image sharing scheme based on bivariate polynomial, besides has most advantages of Shamir scheme, access structure in the new scheme has been greatly enriched. And the most important, the new scheme is much more suitable for image processing.