[Resource Topic] 2017/779: Efficient Random Grid Visual Cryptographic Schemes having Essential Members

Welcome to the resource topic for 2017/779

Efficient Random Grid Visual Cryptographic Schemes having Essential Members

Authors: Bibhas Chandra Das, Md Kutubuddin Sardar, Avishek Adhikari


In this paper we consider OR" based monochrome random grid visual cryptographic schemes (RGVCS) for $t$-$(k,n)^*$ access structure which is a generalization of the threshold $(k,n)$ access structure in the sense that in all the successful attempts to recover the secret image, the $t$ essential participants must always be present. Up to the best of our knowledge, the current proposed work is the first in the literature of RGVCS which provides efficient direct constructions for the $t$-$(k,n)^*$-RGVCS for OR" based model. Finding the closed form of light contrast is a challenging work. However, in this paper we come up with the closed form of the light contrast for the OR" based model. In literature, there are visual cryptographic schemes where the secret reconstruction is done by binary XOR" operation instead of OR" operation to increase the relative contrast of the decoded image. In this paper, we also propose an extended grid based $t$-$(k,n)^*$-RGVCS in which we replace the traditional OR" operation by ``XOR" operation. Note that the use of XOR operation indicates that the decoding must be performed computationally and not visually. We justified our schemes using both experimental as well as simulation based data.

ePrint: https://eprint.iacr.org/2017/779

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .