Image size invariant visual cryptography

摘要

In the visual secret sharing scheme proposed by Naor andShamir[3], a secret image is encoded into shares, of which size islarger than that of secret image and the shares are decoded bystacking them without performing any cropto- graphic computation. Inthis paper we propose a(k,n)visual secret sharing scheme to encode ablack-and-white image into the same size shares as the secret image,where the reconstructed image of the proposed scheme is visible aswell as that of the conventional scheme.