International Journal of Industrial Engineering & Production Research
Iran University of Science & Technology
Sun, Dec 8, 2024
[
Archive
]
Remember me
Create Account
Reset Password
Journal Information
About the Journal
Editorial Board
Aims& Scopes
Journal News
Articles archive
All Issues
Current Issue
For Authors
How to Submit Your Articles
Submission Instruction
Registration
Submit Your Article
Journal Format
Review Process of IJIEPR
Highlights
Graphical abstract
Copy Right
Authorship
Conflict of Interest
Publication Ethics
Revision
Registration
Contact us
Contact Information
Contact us
Facilities
Site map
Registration Form
Search contents
Albume
List of IUST Journal
FAQ
Inform to friends
TOPS
Volume 19, Issue 1 (International Journal of Engineering 2008)
IJIEPR 2008, 19(1): 13-16
|
Back to browse issues page
Download citation:
BibTeX
|
RIS
|
EndNote
|
Medlars
|
ProCite
|
Reference Manager
|
RefWorks
Send citation to:
Mendeley
Zotero
RefWorks
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-en.html
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Massoud Hadian Dehkordi
,
Cheraghi Cheraghi
Abstract:
(8270 Views)
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 C
5
and Peterson graph access structure
Keywords:
Sharing Schemes
,
Visual Cryptography
,
Graph Access Structure
Type of Study:
Research
| Subject:
Other Related Subject
Received: 2010/09/8 | Published: 2008/03/15
Cited by [1] [PDF 96 KB]
(511 Download)
Add your comments about this article : Your username or Email:
Rights and permissions
This work is licensed under a
Creative Commons Attribution-NonCommercial 4.0 International License
.