Extended visual cryptography schemes

Authors:
Andreas Klein;Markus Wessler
Affiliations:
Universitat Kassel, Fachbereich fur Mathematik und Informatik, Heinrich Plett Str. 49 (AVZ), D-34132 Kassel, Germany;Universitat Kassel, Fachbereich fur Mathematik und Informatik, Heinrich Plett Str. 49 (AVZ), D-34132 Kassel, Germany
Venue:
Information and Computation
Year:
2007

Citing 3
Cited 2

Visual cryptography for general access structures

Information and Computation
Extended capabilities for visual cryptography

Theoretical Computer Science
Constructions and Bounds for Visual Cryptography

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming

On general construction for extended visual cryptography schemes

Pattern Recognition
Visual cryptography on graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper we study extended visual cryptography schemes, i.e., shared secret systems where any subset of P shares its own secret.