Date Published:

Abstract:

Unlike traditional visual cryptography based on a threshold mechanism in which the secret image can be revealed by stacking&nbsp;k,(2<=k<=n)&nbsp;shadows or more. In our suggested (kk,nn) progressive secret sharing scheme with unexpanded pixel, we could obtain until&nbsp;n-1n-1&nbsp;revealed secret images with progressive enhanced contrast in an increasing way from the lowest quality, in the case of stacking two shares, to a highest quality in the case of stacking all the&nbsp;nn&nbsp;shares. Our scheme not only has the advantage of the unexpanded shares, but also the use of very simple Boolean XOR and OR operations to recover the secret image perfectly. Moreover, the proposed scheme does not need any codebooks to construct shares. The experimental results indicate the privilege of our method compared with the other related work.