General Constructions for Threshold Multiple-Secret Visual Cryptographic Schemes

摘要

A conventional threshold ($k$ out of $n$ ) visual secret sharing scheme encodes one secret image $P$ into $n$ transparencies (called shares) such that any group of $k$ transparencies reveals $P$ when they are superimposed, while that of less than $k$ ones cannot. We define and develop general constructions for threshold multiple-secret visual cryptographic schemes (MVCSs) that are capable of encoding $s$ secret images $P_{1},P_{2},ldots,P_{s}$ into $n$ shares such that any group of less than $k$ shares obtains none of the secrets, while 1) each group of $k,k+1,ldots,n$ shares reveals $P_{1},P_{2},ldots,P_{s}$ , respectively, when superimposed, referred to as $(k,n,s)$-MVCS where $s=n-k+1$; or 2) each group of $u$ shares reveals $P_{r_{u}}$ where $r_{u}in{0,1,2,ldots,s}$ ($r_{u}=0$ indicates no secret can be seen), $kleq uleq n$ and $2leq sleq n-k+1$, referred to as $(k,n,s,R)$-MVCS in which $R=(r_{k},r_{k+1},ldots,r_{n})$ is called the revealing list. We adopt the skills of linear programming to model $(k,n,s)$ - and $(k,n,s,R)$ -MVCSs as integer linear programs which minimize the pixel expansions under all necessary constraints. The pixel expansions of different problem scales are explored, which have never been reported in the literature. Our constructions are novel and flexible. They can be easily customized to cope with various kinds of MVCSs.