Randomness in secret sharing and visual cryptography schemes
From MaRDI portal
Recommendations
- Randomness in visual cryptography
- New results on the randomness of visual cryptography schemes
- Visual secret sharing by random grids revisited
- Sharing multiple secrets in visual cryptography
- Visual multiple-secret sharing by circle random grids
- Private visual share-homomorphic computation and randomness reduction in visual cryptography
- scientific article; zbMATH DE number 2076151
- Determining the optimal contrast for secret sharing schemes in visual cryptography
- On secret sharing, randomness, and random-less reductions for secret sharing
Cites work
- Constructions and bounds for visual cryptography
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Contrast Optimal Threshold Visual Cryptography Schemes
- Contrast-optimal k out of n secret sharing schemes in visual cryptography. (Extended abstract)
- Decomposition constructions for secret-sharing schemes
- Graph decompositions and secret sharing schemes
- How to share a secret
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- scientific article; zbMATH DE number 1228785 (Why is no real title available?)
- scientific article; zbMATH DE number 553905 (Why is no real title available?)
- scientific article; zbMATH DE number 774344 (Why is no real title available?)
- Improved schemes for visual cryptography
- New results on the randomness of visual cryptography schemes
- On the contrast in visual cryptography schemes
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Randomness in distribution protocols
- Randomness in visual cryptography
- Some improved bounds on the information rate of perfect secret sharing schemes
- Universally ideal secret-sharing schemes
- Visual cryptography
- Visual cryptography for general access structures
- Zero error capacity under list decoding
Cited in
(9)- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Visual secret sharing by random grids revisited
- New results on the randomness of visual cryptography schemes
- Private visual share-homomorphic computation and randomness reduction in visual cryptography
- Randomness in visual cryptography
- A discussion on the relationship between probabilistic visual cryptography and random grid
- ESSVCS: an enriched secret sharing visual cryptography
- Randomness recoverable secret sharing schemes
- Ideal contrast visual cryptography schemes with reversing
This page was built for publication: Randomness in secret sharing and visual cryptography schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826638)