en و موضوعات مربوط Other Related Subject پژوهشي Research <a name="OLE_LINK2"></a><a name="OLE_LINK1"><span><span style="mso-bookmark: OLE_LINK2"><font face="Times New Roman" size="3">Given a graph G, a visual cryptography scheme based on the graph G is a</font></span><span> 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 </span><span>(G), moreover we present a the lower bound on the pixel expansion of basis matrices C₅ and Peterson graph access structure</span></span></a> Sharing Schemes, Visual Cryptography, Graph Access Structure 13 16 http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1-107&slc_lang=en&sid=1 Massoud Hadian Dehkordi 18003194753284600593 18003194753284600593 Yes Cheraghi Cheraghi a_cheraghi@iust.ac.ir 18003194753284600663 18003194753284600663 No