Image encryption by multiple random grids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1088244 (Why is no real title available?)
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- scientific article; zbMATH DE number 2102766 (Why is no real title available?)
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Efficient visual secret sharing scheme for color images
- Image encryption by random grids
- Improved schemes for visual cryptography
- New Results on Visual Cryptography
- New colored visual secret sharing schemes
- On the contrast in visual cryptography schemes
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
Cited in
(12)- Random-grid based region incrementing visual secret sharing
- Measure-independent characterization of contrast optimal visual cryptography schemes
- Visual multiple secret sharing based upon turning and flipping
- Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures
- Almost-aspect-ratio-invariant visual cryptography without adding extra subpixels
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- Visual cryptograms of random grids for threshold access structures
- A discussion on the relationship between probabilistic visual cryptography and random grid
- Distortionless visual multi-secret sharing based on random grid
- Image encryption by random grids
- Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
- Advance image encryption technique utilizing compression, dynamical system and S-boxes
This page was built for publication: Image encryption by multiple random grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015232)
