Optimal colored threshold visual cryptography schemes

Authors:
Stelvio Cimato;Roberto De Prisco;Alfredo De Santis
Affiliations:
Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, Baronissi, Italy;Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, Baronissi, Italy and Akamai Faculty Group, Akamai Technologies, Cambridge, Cambridge, MA;Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, Baronissi, Italy
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 6
Cited 16

Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Visual cryptography for general access structures

Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes

Designs, Codes and Cryptography
New Colored Visual Secret Sharing Schemes

Designs, Codes and Cryptography
Extended capabilities for visual cryptography

Theoretical Computer Science
Improved Schemes for Visual Cryptography

Designs, Codes and Cryptography

Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation

Pattern Recognition
Colored visual cryptography without color darkening

Theoretical Computer Science
Colored visual cryptography scheme based on additive color mixing

Pattern Recognition
Visual secret sharing for multiple secrets

Pattern Recognition
Security Analysis of Authentication of Images Using Recursive Visual Cryptography

Cryptologia
MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty

Signal Processing
On general construction for extended visual cryptography schemes

Pattern Recognition
Step construction of visual cryptography schemes

IEEE Transactions on Information Forensics and Security
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability

Image and Vision Computing
A comprehensive study of visual cryptography

Transactions on data hiding and multimedia security V
Probabilistic visual secret sharing schemes for grey-scale images and color images

Information Sciences: an International Journal
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images

Designs, Codes and Cryptography
Colored visual cryptography without color darkening

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Flexible visual cryptography scheme without distortion

IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
On the security of multi-secret visual cryptography scheme with ring shares

IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Color visual cryptography schemes for black and white secret images

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visual cryptography schemes allow the encoding of a secret image into n shares which are distributed to the participants. The shares are such that only qualified subsets of participants can "visually" recover the secret image. Usually the secret image consist of black and white pixels. In colored threshold visual cryptography schemes the secret image is composed of pixels taken from a given set of c colors. The pixels expansion and the contrast of a scheme are two measures of the goodness of the scheme.In this paper, we study c-color (k,n)-threshold visual cryptography schemes and provide a characterization of contrast-optimal schemes. More specifically we prove that there exists a contrast-optimal scheme that is a member of a special set of schemes, which we call canonical schemes, and that satisfy strong symmetry properties.Then we use canonical schemes to provide a constructive proof of optimality, with respect to the pixel expansion, of c-color (n,n)-threshold visual cryptography schemes.Finally, we provide constructions of c-color (2,n)-threshold schemes whose pixels expansion improves on previously proposed schemes.