Constructions and Properties of k out of nVisual Secret Sharing Schemes

  • Authors:
  • Eric R. Verheul;Henk C. A. Van Tilborg

  • Affiliations:
  • Ministry of the Interior, P.O. Box 20010, 2500 EA, the Hague, the Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513 5600 MB, Eindhoven, the Netherlands

  • Venue:
  • Designs, Codes and Cryptography
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

The idea of visual k out of nsecret sharing schemes was introduced in Naor. Explicit constructionsfor k = 2 and k = n can be found there.For general k out of n schemes boundshave been described.Here, two general kout of n constructions are presented. Their parametersare related to those of maximum size arcs or MDS codes. Further,results on the structure of k out of nschemes, such as bounds on their parameters, are obtained. Finally,the notion of coloured visual secret sharing schemes is introducedand a general construction is given.