The following pages link to (Q4818854):
Displaying 18 items.
- Visual cryptography for grey level images (Q294839) (← links)
- Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques (Q300400) (← links)
- Graph access structures with optimal pixel expansion three (Q391637) (← links)
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images (Q404941) (← links)
- Visual cryptograms of random grids for threshold access structures (Q482284) (← links)
- The use of mathematical linguistic methods in creating secret sharing threshold algorithms (Q604078) (← links)
- Visual cryptography on graphs (Q626454) (← links)
- Extended visual cryptography schemes (Q879599) (← links)
- Image encryption by multiple random grids (Q1015232) (← links)
- Contrast-optimal k out of n secret sharing schemes in visual cryptography (Q1575451) (← links)
- Extended capabilities for visual cryptography (Q1589430) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Optimal \((k, n)\) visual cryptographic schemes for general \(k\) (Q2380397) (← links)
- Maximal contrast color visual secret sharing schemes (Q2420478) (← links)
- On \({(k,n)^\ast}\)-visual cryptography scheme (Q2439750) (← links)
- Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes (Q2948251) (← links)
- Visual cryptography scheme on graphs with $m^{*}(G)=4$ (Q5135731) (← links)
- A New Approach to Image Sharing with High-Security Threshold Structure (Q5501945) (← links)
