Sharing multiple secrets in visual cryptography
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?)
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Efficient visual secret sharing scheme for color images
- On the contrast in visual cryptography schemes
- Visual cryptography for general access structures
- Visual cryptography for gray-level images by dithering techniques
Cited in
(14)- Visual multiple-secret sharing by circle random grids
- Visual secret sharing by random grids revisited
- Visual double secret sharing with mask image
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
- Efficient multi-secret image sharing based on Boolean operations
- Visual multiple secret sharing based upon turning and flipping
- Randomness in secret sharing and visual cryptography schemes
- On general construction for extended visual cryptography schemes
- Meaningful share generation for increased number of secrets in visual secret-sharing scheme
- Prevention of cheating in visual cryptography by using coherent patterns
- A discussion on the relationship between probabilistic visual cryptography and random grid
- Distortionless visual multi-secret sharing based on random grid
- Visual secret sharing for multiple secrets
- Ideal secure multi-secret visual cryptography scheme with ring shares
This page was built for publication: Sharing multiple secrets in visual cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996460)
