Constructions and analysis of some efficient t-(k,n)^-visual cryptographic schemes using linear algebraic techniques
From MaRDI portal
(Redirected from Constructions and analysis of some efficient t-(k,n)^-visual cryptographic schemes using linear algebraic techniques)
Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
Recommendations
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- Construction of a \((k,n)\)-visual cryptography scheme
- Optimal (k, n) visual cryptographic schemes for general k
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- On the contrast in visual cryptography schemes
Cites work
- Colored visual cryptography without color darkening
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Contrast Optimal Threshold Visual Cryptography Schemes
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- scientific article; zbMATH DE number 1950101 (Why is no real title available?)
- scientific article; zbMATH DE number 2102766 (Why is no real title available?)
- Image encryption by multiple random grids
- Image encryption by random grids
- Improved schemes for visual cryptography
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- New Results on Visual Cryptography
- On (k,n) visual cryptography scheme with t essential parties
- On \({(k,n)^\ast}\)-visual cryptography scheme
- On general construction for extended visual cryptography schemes
- On the contrast in visual cryptography schemes
- Optimal (k, n) visual cryptographic schemes for general k
- Optimal colored threshold visual cryptography schemes
- Progress in Cryptology - INDOCRYPT 2003
- Progress in Cryptology - INDOCRYPT 2004
- Visual cryptography for general access structures
Cited in
(2)
This page was built for publication: Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300400)
