Very efficient(t,n) threshold visual secret sharing scheme

This article firstly proposes a multi-secret sharing scheme,which will share t secrets and needs to solve t simultaneous equations.Then based on the multi-secret sharing ideal,we present a new(t,n)-threshold visual secret sharing scheme.The scheme splits a secret image into t sub-secret images,in which each sub-secret image’s size is 1/t of the original secret image;and then by t sub-secret images,computes n sharing images sent secretly n participants as the shares,which are the same size as the sub-secret images.So that any t or more shares can recover the secret image,but any t-1 or fewer of them gain no information about the original image.In addition,the recovered image is the same as the original secret image and there is no loss of the secret.The new scheme is secure and very efficient,which is a perfect(t,n)-threshold scheme to share bw,gray-level or color images in a secret way.