Designs, Codes and Cryptography

, Volume 11, Issue 2, pp 179-196

First online:

Constructions and Properties of k out of n Visual Secret Sharing Schemes

  • Eric R. VerheulAffiliated withMinistry of the Interior
  • , Henk C. A. van TilborgAffiliated withDepartment of Mathematics and Computing Science, Eindhoven University of Technology

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

visual cryptography secret sharing schemes MDS codes arcs