You are looking at a specific version 20021223:133055 of this paper. See the latest version.

Paper 2002/195

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes

H.D.L. Hollmann, J.H.v. Lint, L. Tolhuizen, P. Tuyls

Abstract

An (n,k) pair is a pair of binary nxm matrices (A,B), such that the weight of the modulo-two sum of any i rows, 1\leq i \leq k, from A or B is equal to a_i or b_i, respectively, and moreover, a_i=b_i, for 1\leq i < k, while a_k \neq b_k. In this note we first show how to construct an (n,k) Threshold Visual Secret Sharing Scheme from an (n,k) pair. Then, we explicitly construct an (n,k)-pair for all n and k with 1 \leq k <n.

Metadata
Available format(s)
PS
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Light PolarisationXOR(MDS) codesThreshold Visual Secret Sharing Schemes
Contact author(s)
pim tuyls @ philips com
History
2002-12-23: received
Short URL
https://ia.cr/2002/195
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.