Sharing multiple secrets in visual cryptography
DOI10.1016/J.PATCOG.2007.03.012zbMATH Open1129.68092OpenAlexW2027570214MaRDI QIDQ996460FDOQ996460
Authors: Shyong Jian Shyu, Shih-Yu Huang, Yeuan-Kuen Lee, Ran-Zan Wang, Kun Chen 
Publication date: 14 September 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.03.012
Recommendations
Data encryption (aspects in computer science) (68P25) Computing methodologies for image processing (68U10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- On the contrast in visual cryptography schemes
- Visual cryptography for general access structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient visual secret sharing scheme for color images
- Visual cryptography for gray-level images by dithering techniques
Cited In (14)
- Visual secret sharing by random grids revisited
- Randomness in secret sharing and visual cryptography schemes
- Visual double secret sharing with mask image
- Efficient multi-secret image sharing based on Boolean operations
- Ideal secure multi-secret visual cryptography scheme with ring shares
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
- Visual multiple secret sharing based upon turning and flipping
- On general construction for extended visual cryptography schemes
- Meaningful share generation for increased number of secrets in visual secret-sharing scheme
- A discussion on the relationship between probabilistic visual cryptography and random grid
- Distortionless visual multi-secret sharing based on random grid
- Visual multiple-secret sharing by circle random grids
- Visual secret sharing for multiple secrets
- Prevention of cheating in visual cryptography by using coherent patterns
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)
