Constructions and properties of k out of n visual secret sharing schemes

E.R. Verheul, H.C.A. Tilborg, van

Research output: Contribution to journalArticleAcademicpeer-review

289 Citations (Scopus)
1 Downloads (Pure)


The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described. Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.
Original languageEnglish
Pages (from-to)179-196
Number of pages18
JournalDesigns, Codes and Cryptography
Issue number2
Publication statusPublished - 1997


Dive into the research topics of 'Constructions and properties of k out of n visual secret sharing schemes'. Together they form a unique fingerprint.

Cite this