Maximal Independent Sets for the Pixel Expansion of Graph Access Structure
Authors
Abstract:
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 .
similar resources
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
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 grap...
full textfacilitating lexical access for the fluent production of speech
the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis , a one- way anova experimental design was carried out. 24 senior student of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inte...
15 صفحه اولfaciliting lexical access for the fluent production of speech
the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis,a one-way anova experimental design was carried out. 24 sednior students of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inter...
15 صفحه اولMaximal independent sets in the covering graph of the cube
Several familiar problems in extremal set theory can be cast as questions about the maximum possible size of an independent set defined on a suitable graph, about the total number of independent sets in such graphs, or about enumeration of the maximal independent sets. Here we find bounds on the number of maximal independent sets in the covering graph of a hypercube. © 2010 Elsevier B.V. All ri...
full textOn the number of maximal independent sets in a graph
Let G be a (simple, undirected, finite) graph. A set S ⊆ V (G) is independent if no edge of G has both its endpoints in S. An independent set S is maximal if no independent set of G properly contains S. Let MIS(G) be the set of all maximal independent sets in G. Miller and Muller (1960) and Moon and Moser (1965) independently proved that the maximum, taken over all n-vertex graphs G, of |MIS(G)...
full textOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
full textMy Resources
Journal title
volume 19 issue 2
pages 13- 16
publication date 2008-07
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023