A Novel(k,n) Threshold Scheme for Visual Secret Sharing
Dongping Huang · Dianzi xuebao · 2006
A novel k-out-of-n threshold scheme for visual secret sharing is proposed.The construction scheme of basic matrix is brought forward from the approximate best optimized solution of the equation set which is established on the basis of contrast condition and security condition of the visual secret sharing.The proposed method analyses the(k,n) and(n,n) schemes uniformly and brings them into an integral framework.Furthermore,a fraction of algorithm operations were replaced by theoretical analysis in the new scheme.Consequently,it achieves higher efficiency with same security intensity compared with the previous schemes.