Bounds for Visual Cryptography Schemes

Details Bounds for Visual Cryptography Schemes Bounds for Visual Cryptography Schemes

2007-10-25

arxiv.org/abs/0710.4828v5

Computer Science

Cryptography and Security

Scientific paper

In this paper, we investigate the best pixel expansion of the various models of visual cryptography schemes. In this regard, we consider visual cryptography schemes introduced by Tzeng and Hu [13]. In such a model, only minimal qualified sets can recover the secret image and that the recovered secret image can be darker or lighter than the background. Blundo et al. [4] introduced a lower bound for the best pixel expansion of this scheme in terms of minimal qualified sets. We present another lower bound for the best pixel expansion of the scheme. As a corollary, we introduce a lower bound, based on an induced matching of hypergraph of qualified sets, for the best pixel expansion of the aforementioned model and the traditional model of visual cryptography realized by basis matrices. Finally, we study access structures based on graphs and we present an upper bound for the smallest pixel expansion in terms of strong chromatic index.

Affiliated with

Also associated with

No associations

Rating

Bounds for Visual Cryptography Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for Visual Cryptography Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for Visual Cryptography Schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432855