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

被引：261

作者：

Verheul E.R. ^{[1
]}

Van Tilborg H.C.A. ^{[2
]}

机构：

[1] Ministry of the Interior, 2500 EA the Hague

[2] Dept. of Math. and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven

来源：

Designs, Codes and Cryptography | 1997年 / 11卷 / 2期

关键词：

Arcs; MDS codes; Secret sharing schemes; Visual cryptography;

D O I：

10.1023/A:1008280705142

中图分类号：

学科分类号：

摘要：

The idea of visual k out of n secret sharing schemes was introduced in [4]. 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.

引用

页码：179 / 196

页数：17

共 8 条

[1]

Arazi B., Dinstein I., Kafri O., Intuition, perception, and secure communication, IEEE Transactions on Systems, Man, and Cybernetics, 19, pp. 1016-1020, (1989)

[2]

Van Der Heijden F., Image Based Measurement Systems, (1994)

[3]

Mac Williams F.J., Sloane N.J.A., The Theory of Error-Correcting Codes, (1977)

[4]

Naor M., Shamir A., Visual cryptography, Preproceedings of Eurocrypt '94, pp. 1-11, (1994)

[5]

Pratt W.K., Digital Image Processing, (1991)

[6]

Rudin W., Functional Analysis, (1973)

[7]

Storme L., Thas J.A., M. D. S. codes and arcs in PG(n, q) with q even: An improvement of the bounds of Bruen, Thas and Blokhuis, Journal of Combinatorial Theory, Series A, 62, pp. 139-154, (1993)

[8]

Thas J.A., Projective geometry over a finite field, Handbook of Incidence Geometry, (1995)

← 1 →