Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes
From MaRDI portal
Publication:2948251
DOI10.1007/978-3-319-04268-8_3zbMath1395.94277OpenAlexW1432917462MaRDI QIDQ2948251
Roberto De Prisco, Paolo D'Arco, Alfredo De Santis
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04268-8_3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Color visual cryptography schemes for black and white secret images
- Visual cryptography on graphs
- Image encryption by random grids
- Visual cryptography schemes with optimal pixel expansion
- Image encryption by multiple random grids
- Colored visual cryptography without color darkening
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- New colored visual secret sharing schemes
- Extended capabilities for visual cryptography
- On the contrast in visual cryptography schemes
- Visual secret sharing by random grids revisited
- Optimal colored threshold visual cryptography schemes
- Visual cryptography for general access structures
- Using Colors to Improve Visual Cryptography for Black and White Images
- Contrast Optimal Threshold Visual Cryptography Schemes
- Progress in Cryptology - INDOCRYPT 2003
- Security in Communication Networks
- Fundamentals of Computation Theory
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- Improved schemes for visual cryptography
This page was built for publication: Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes