Research On Binary Image Visual Cryptography Scheme

Most recent papers about binary Visual Cryptography schemes are dedicated to study a higher contrast of recovered images or a smaller share size in Visual secret sharing scheme.This paper proposes our binary ( k , n )- VCSbased on the secret sharing schemes. A strong access structure is given which uses the feature of the solution of a system of linear equations over the binary field and hierarchical method for constructing basis binary matrices S 0 ,S 1, and the ( k , n )- VCS is obtained and in almost all the case a much smaller pixel expansion is gained from this method.On the other hand, in this paper a Visual Cryptography Scheme on a new method of probabilistic are discussed ,which is a threshold scheme with perfect black pixel reconstruction and which by introducing two sets C0 ,C1 .We consider an unknown probability distribution on the elements of C0 ,C1 .and provides some linear constraints on the probabilities of C0 ,C1 elements. By solving the provided system of linear equations, considering a probability distribution on the elements of C0 ,C1 can reduce the pixel expansion and increase the contrast.