Visual cryptography on graphs
From MaRDI portal
Publication:626454
DOI10.1007/s10878-009-9241-xzbMath1209.90337OpenAlexW2056433828MaRDI QIDQ626454
Rafail Ostrovsky, Steve Lu, Daniel Manchala
Publication date: 18 February 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9241-x
Related Items (1)
Cites Work
- Visual cryptography schemes with optimal pixel expansion
- Extended visual cryptography schemes
- Tight bounds on the information rate of secret sharing schemes
- Sharing one secret vs. sharing many secrets.
- Extended capabilities for visual cryptography
- Graph decompositions and secret sharing schemes
- Multi secret image color visual cryptography schemes for general access structures\(^{*}\)
- Visual cryptography for general access structures
- How to share a secret
- New Results on Visual Cryptography
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Decomposition constructions for secret-sharing schemes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Visual cryptography on graphs