Volume 19, Issue 2 (International Journal of Engineering 2008)                   IJIEPR 2008, 19(2): 13-16 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Hadian Dehkordi M, Cheraghi A. Maximal Independent Sets for the Pixel Expansion of Graph Access Structure . IJIEPR. 2008; 19 (2) :13-16
URL: http://ijiepr.iust.ac.ir/article-1-16-en.html
Abstract:   (4863 Views)

 Abstract : A visual cryptography scheme based on a given 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 a maximal independent sets of the graph G was applied to propose a lower bound on the pixel expansion of visual cryptography schemes with graph access structure (G ). In addition a lower bound on the pixel expansion of basis matrices C5 and Peterson graph access structure were presented .


Full-Text [PDF 169 kb]   (1474 Downloads)    
Type of Study: Research | Subject: Material Managment
Received: 2009/04/20

Cited by [1] [PDF 95 KB]  (298 Download)
Add your comments about this article : Your username or Email:

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb