A New Color Visual Secret Sharing Scheme
Runhua Shi · Jisuanji yingyong yanjiu · 2006
Proposes a color visual secret sharing scheme based on solving the linear equations.The scheme allows to encode an image into n shared images so that any k or more shares can recover the secret image,but any k-1 or fewer of them gain no information about the original image.In addition,each shared image has the same size that the original one,and the recovered image is exactly the same than the secret image such that ther is no loss of the secret.Thus,it is an ideal and perfect(k,n) threshold scheme to share bw,gray-level or color images in a secret way.