Polynomial Based Progressive Secret Image Sharing Scheme With Smaller Shadow Size

Abstract

Progressive secret image sharing (PSIS) scheme attracts the interests of researchers in recent years. Many approaches have been proposed to construct PSIS schemes. In most of these schemes, the size of the shadow is expanded from the original image. On the contrary, polynomial-based PSIS can reduce shadow size from the original image. Recently, Yang and Huang proposed a polynomial-based (k, n) PSIS, where the image can be progressively reconstructed from k to n shadows. However, the problem of Yang-Huang's scheme is that the percentage of the recovered partial image from t shadows is extremely low when t is close to k. Later, Yang and Chu constructed another polynomial-based (k, n) PSIS with smooth property to solve this problem, but the size of the shadow is expanded greatly from Yang-Huang' scheme. In this paper, we propose a new (k, n) PSIS based on polynomial to overcome the drawbacks of these two schemes. In our scheme, t shadows (t is close to k) can recover more percentage partial image than Yang-Huang's scheme with a little shadow size expansion; comparing with Yang-Chu's scheme, our scheme achieves almost the same smooth property with much smaller shadow size.