Contrast-optimal k out of n secret sharing schemes in visual cryptography
From MaRDI portal
Publication:1575451
DOI10.1016/S0304-3975(99)00243-1zbMath0947.68048OpenAlexW2038948825WikidataQ127647428 ScholiaQ127647428MaRDI QIDQ1575451
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00243-1
Related Items (16)
Ideal contrast visual cryptography schemes with reversing ⋮ Two secret sharing schemes based on Boolean operations ⋮ Boolean Composition of Visual Secret Sharing Schemes ⋮ Optimal \((k, n)\) visual cryptographic schemes for general \(k\) ⋮ Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels ⋮ Visual cryptographic schemes using combined Boolean operations ⋮ Secure Two-Party Computation: A Visual Way ⋮ Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes ⋮ A study for security of visual cryptography ⋮ On \({(k,n)^\ast}\)-visual cryptography scheme ⋮ Coloured visual cryptography using fixed size meaningful share ⋮ Friendly progressive visual secret sharing ⋮ Construction of a \((k,n)\)-visual cryptography scheme ⋮ Bounds for visual cryptography schemes ⋮ Visual cryptography scheme on graphs with $m^{*}(G)=4$ ⋮ Colored visual cryptography without color darkening
Cites Work
This page was built for publication: Contrast-optimal k out of n secret sharing schemes in visual cryptography
