جلد 19، شماره 1 - ( 12-1386 )
جلد 19 شماره 1 صفحات 16-13 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Hadian Dehkordi M, Cheraghi C. MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE. IJIEPR 2008; 19 (1) :13-16
URL: http://ijiepr.iust.ac.ir/article-1-162-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-162-fa.html
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1386; 19 (1) :13-16
چکیده: (8238 مشاهده)
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
Cited by [1] [PDF 96 KB] (508 دریافت)
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |