- Title
- On (k, n)*-visual cryptography scheme
- Creator
- Arumugam, S.; Lakshmanan, R.; Nagar, Atulya K.
- Relation
- Designs, Codes, and Cryptography Vol. 71, Issue 1, p. 153-162
- Publisher Link
- http://dx.doi.org/10.1007/s10623-012-9722-2
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2014
- Description
- Let P = {1, 2,..., n} be a set of elements called participants. In this paper we construct a visual cryptography scheme (VCS) for the strong access structure specified by the set Γ₀ of all minimal qualified sets, where Γ₀={S : S ⊆ P, 1 ∈ S} and |S| = k}. Any VCS for this strong access structure is called a (k, n)*-VCS. We also obtain bounds for the optimal pixel expansion and optimal relative contrast for a (k, n)*-VCS.
- Subject
- strong access structure; visual cryptography scheme; pixel expansion; relative contrast
- Identifier
- http://hdl.handle.net/1959.13/1304119
- Identifier
- uon:20800
- Identifier
- ISSN:0925-1022
- Language
- eng
- Reviewed
- Hits: 791
- Visitors: 939
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|