A new black and white visual cryptographic scheme for general access structures

Authors:
Avishek Adhikari;Tridib Kumar Dutta;Bimal Roy
Affiliations:
Applied Statistics Unit, Indian Statistical Institute, Calcutta, India;SQC Unit, Indian Statistical Institute, Calcutta, India;Applied Statistics Unit, Indian Statistical Institute, Calcutta, India
Venue:
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Year:
2004

Citing 5
Cited 2

Visual cryptography for general access structures

Information and Computation
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
Visual cryptography for grey level images

Information Processing Letters
Constructions and Bounds for Visual Cryptography

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
New Results on Visual Cryptography

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology

Applications of Partially Balanced Incomplete Block Designs in Developing (2,n) Visual Cryptographic Schemes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On (k, n)*-visual cryptography scheme

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new construction of a black and white visual cryptographic scheme for general access structure. We prove that our scheme gives a strong access structure. We find out the conditions for which our scheme gives less pixel expansion compared to the schemes given in Section 4.2 of [1]. We also propose a modified algorithm giving better result from the pixel expansion’s point of view. As a particular case of general access structure, we get (k,n) – VTS with 2 ≤ k ≤ n. The (n,n) – VTS obtained from our scheme attains the optimal pixel expansion and the relative contrast. We compare the (k,n) – VTS obtained from the schemes mentioned in Section 4.1 and Section 4.2 of [1] with the (k,n) – VTS obtained from our method and it has been shown that in almost all the cases our pixel expansion is less compared to the other two schemes.