- Title
- Graph access structures with optimal pixel expansion three
- Creator
- Arumugam, S.; Lakshmanan, R.; Nagar, Atulya K.
- Relation
- Information and Computation Vol. 230, p. 67-75
- Publisher Link
- http://dx.doi.org/10.1016/j.ic.2013.07.002
- Publisher
- Academic Press
- Resource Type
- journal article
- Date
- 2013
- Description
- Let G =(V,E) be a graph without isolated vertices. Let Γ(G) denote the strong access structure whose basis is the edge set E and let m∗(G) denote the optimal pixel expansion of a visual cryptography scheme for Γ(G). In this paper we obtain a characterization of all connected graphs G with m∗(G) = 3.
- Subject
- visual cryptography scheme; strong access structure; pixel expansion; relative contrast
- Identifier
- http://hdl.handle.net/1959.13/1296913
- Identifier
- uon:19331
- Identifier
- ISSN:0890-5401
- Language
- eng
- Reviewed
- Hits: 706
- Visitors: 788
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|