A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
Extended capabilities for visual cryptography
Theoretical Computer Science
Communications of the ACM
Constructions and Bounds for Visual Cryptography
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Efficient Sharing of Many Secrets
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New Results on Visual Cryptography
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Extended visual cryptography schemes
Information and Computation
Visual cryptography schemes with optimal pixel expansion
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V,E) where every node and every edge are assigned an arbitrary image. Images on the vertices are "public" and images on the edges are "secret". The problem that we are considering is how to make a construction such that when the encoded images of two adjacent vertices are printed on transparencies and overlapped, the secret image corresponding to the edge is revealed. We define the most stringent security guarantees for this problem (perfect secrecy) and show a general construction for all graphs where the cost (in terms of pixel expansion and contrast of the images) is proportional to the chromatic number of the cube of the underlying graph. For the case of bounded degree graphs, this gives us constant-factor pixel expansion and contrast. This compares favorably to previous works, where pixel expansion and contrast are proportional to the number of images.