Pages that link to "Item:Q1575451"
From MaRDI portal
The following pages link to Contrast-optimal k out of n secret sharing schemes in visual cryptography (Q1575451):
Displaying 15 items.
- Construction of a \((k,n)\)-visual cryptography scheme (Q510417) (← links)
- Ideal contrast visual cryptography schemes with reversing (Q835031) (← links)
- Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels (Q851738) (← links)
- Bounds for visual cryptography schemes (Q968192) (← links)
- Colored visual cryptography without color darkening (Q1022609) (← links)
- Two secret sharing schemes based on Boolean operations (Q2373477) (← links)
- Optimal \((k, n)\) visual cryptographic schemes for general \(k\) (Q2380397) (← links)
- On \({(k,n)^\ast}\)-visual cryptography scheme (Q2439750) (← links)
- Friendly progressive visual secret sharing (Q2469737) (← links)
- Boolean Composition of Visual Secret Sharing Schemes (Q2907511) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
- Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes (Q2948251) (← links)
- Coloured visual cryptography using fixed size meaningful share (Q2995513) (← links)
- Visual cryptographic schemes using combined Boolean operations (Q5069894) (← links)
- Visual cryptography scheme on graphs with $m^{*}(G)=4$ (Q5135731) (← links)
