Graph access structures with optimal pixel expansion three

Authors:
S. Arumugam;R. Lakshmanan;Atulya K. Nagar
Affiliations:
National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil 626126, India and Department of Computer and Mathematical Sciences, C ...;National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil 626126, India;Department of Computer and Mathematical Sciences, Centre for Applicable Mathematics and Systems Science (CAMSS), Liverpool Hope University, Hope Park, Liverpool, L16 9JD, UK
Venue:
Information and Computation
Year:
2013

Citing 4
Cited 0

Visual cryptography for general access structures

Information and Computation
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
Graphs and Digraphs, Fourth Edition

Graphs and Digraphs, Fourth Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G=(V,E) be a graph without isolated vertices. Let @C(G) denote the strong access structure whose basis is the edge set E and let m^@?(G) denote the optimal pixel expansion of a visual cryptography scheme for @C(G). In this paper we obtain a characterization of all connected graphs G with m^@?(G)=3.