Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images

Authors:
Miyuki Uno;Mikio Kano
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Hitachi, Japan 316-8511;Department of Computer and Information Sciences, Ibaraki University, Hitachi, Japan 316-8511
Venue:
Information Security and Cryptology --- ICISC 2008
Year:
2009

Citing 6
Cited 0

Visual cryptography for general access structures

Information and Computation
Improved Schemes for Visual Cryptography

Designs, Codes and Cryptography
New Results on Visual Cryptography

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

Designs, Codes and Cryptography
Visual cryptography schemes with dihedral group access structure for many images

ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste's method. However the contrast of its scheme is 1/(2n ). In this paper, it is shown that for every integer n *** 4, there exists no construction of such a visual secret sharing scheme having a perfect black reconstruction and contrast at least 1/4. Also for every even integer n *** 4, a new construction of such a visual sharing scheme that satisfies a slightly weaker condition and has a contrast 1/4 is given.