MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Abstract

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the graph G to propose a lower bound on the pixel expansion of visual cryptography schemes with graph access structure (G), moreover we present a the lower bound on the pixel expansion of basis matrices C5 and Peterson graph access structure

Keywords

• Sharing Schemes
• Visual Cryptography
• Graph Access Structure