Threshold Visual Cryptographic Scheme With Meaningful Shares

摘要: In a conventional threshold k out of n visual cryptographic scheme (( k,n)-VCS, for short), one secret image P can be encoded into seemingly random transparencies (called shares) such that the superimposed result any group or more reveal to our eyes, while less than ones cannot. To ease management and identification, shares may look meaningful, instead random, pictures. Given shared by participants cover C, we study ( k, n)-VCS with meaningful (denoted as n)-VCS-MS) in this letter where could recognized C their superimpositions follow requirements n)-VCS. We present formal definition n)-VCS-MS develop an efficient construction way integer linear programming. Experimental results demonstrate effectiveness construction.