Optimal \((k, n)\) visual cryptographic schemes for general \(k\) (Q2380397): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:56, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal \((k, n)\) visual cryptographic schemes for general \(k\) |
scientific article |
Statements
Optimal \((k, n)\) visual cryptographic schemes for general \(k\) (English)
0 references
26 March 2010
0 references
In a \((k,n)\) visual cryptographic scheme (VCS), a secret image consisting of black and white pixels is encrypted into \(n\) pages of cipher text, each printed on a transparency sheet which are distributed among \(n\) participants. The image can be visually identified (say by human eyes) if at least (but not less) any \(k\geq 2\) of these sheets are stacked on the top of each other. Employing a Kronecker algebra of Boolean matrices, necessary and sufficient conditions are proved for the existence of a \((k,n)\) VCS with a prior specification of relative contrast. Based on an \(L_1\)-norm and linear programming formulation, connections between visual cryptography and statistical model fitting are established with the help of which the conjectures made by \textit{C. Blundo} et al. [SIAM J. Discrete Math. 16, No. 2, 224--261 (2003; Zbl 1039.94006)] for \(k=4\), and \(5\) are settled. Finally, it is shown how block designs can be used to construct optimal VCS with respect to the average and minimal relative contrasts in case \(k=3\).
0 references
block design
0 references
Kronecker algebra
0 references
\(L_1\) norm
0 references
pixel expansion
0 references
progressive optimality
0 references
relative contrast
0 references
unbalanced visual cryptographic scheme
0 references