On (k, n)*-visual cryptography scheme

Authors:
S. Arumugam;R. Lakshmanan;Atulya K. Nagar
Affiliations:
National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Krishnankoil, India 626 126 and School of Electrical Engineering and Computer Science, The Univ ...;National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Krishnankoil, India 626 126;Department of Computer and Mathematical Sciences Centre for Applicable Mathematics and Systems Science (CAMSS), Liverpool Hope University, Liverpool, UK L16 9JD
Venue:
Designs, Codes and Cryptography
Year:
2014

Citing 11
Cited 0

Visual cryptography for general access structures

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

Designs, Codes and Cryptography
Contrast-optimal k out of n secret sharing schemes in visual cryptography

Theoretical Computer Science - computing and combinatorics
Improved Schemes for Visual Cryptography

Designs, Codes and Cryptography
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
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

Combinatorics, Probability and Computing
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 optimal pixel expansion

Theoretical Computer Science
Optimal (k, n) visual cryptographic schemes for general k

Designs, Codes and Cryptography
A new black and white visual cryptographic scheme for general access structures

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P = {1, 2, . . . , n} be a set of elements called participants. In this paper we construct a visual cryptography scheme (VCS) for the strong access structure specified by the set Γ0 of all minimal qualified sets, where $${\Gamma_0=\{S: S\subseteq P, 1\in S}$$ and |S| = k}. Any VCS for this strong access structure is called a (k, n)*-VCS. We also obtain bounds for the optimal pixel expansion and optimal relative contrast for a (k, n)*-VCS.