Extended visual cryptography schemes
From MaRDI portal
Publication:879599
DOI10.1016/J.IC.2006.12.005zbMATH Open1115.68077arXivmath/0302043OpenAlexW2037449832MaRDI QIDQ879599FDOQ879599
Authors: Markus Wessler, Andreas Klein
Publication date: 14 May 2007
Published in: Information and Computation (Search for Journal in Brave)
Abstract: Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into shadow images and to give exactly one such shadow image to each member of a group of persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of or the question of contrast optimizing, in this paper we study extended visual cryptography schemes, i.e. shared secret systems where any subset of shares its own secret.
Full work available at URL: https://arxiv.org/abs/math/0302043
Recommendations
Cites Work
Cited In (8)
- Visual cryptography
- Title not available (Why is that?)
- Flexible Visual Cryptography Scheme and Its Application
- Title not available (Why is that?)
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Extended capabilities for visual cryptography
- Visual cryptography on graphs
- On general construction for extended visual cryptography schemes
This page was built for publication: Extended visual cryptography schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879599)