A Linear Construction of Secret Sharing Schemes

In this paper, we will generalize the vector space construction due to Brickell. This generalization, introduced by Bertilsson, leads to secret sharing schemes with rational information rates in which the secret can be computed efficiently by each qualified group. A one to one correspondence between the generalized construction and linear block codes is stated, and a matrix characterization of the generalized construction is presented. It turns out that the approach of minimal codewords by Massey is a special case of this construction. For general access structures we present an outline of an algorithm for determining whether a rational number can be realized as information rate by means of the generalized vector space construction. If so, the algorithm produces a secret sharing scheme with this information rate.

[1]  P. Lancaster,et al.  The theory of matrices : with applications , 1985 .

[2]  Marten van Dijk.  A Linear Construction of Perfect Secret Sharing Schemes , 1994, EUROCRYPT.

[3]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[4]  M. van Dijk.  The optimal linear worst-case information rate , 1997 .

[5]  Alfredo De Santis,et al.  Graph Decompositions and Secret Sharing Schemes , 1992, EUROCRYPT.

[6]  G. R. Blakley,et al.  Linear Algebra Approach to Secret Sharing Schemes , 1993, Error Control, Cryptology, and Speech Compression.

[7]  Douglas R. Stinson,et al.  New General Lower Bounds on the Information Rate of Secret Sharing Schemes , 1992, CRYPTO.

[8]  Ken Martin.  Discrete Structures in the Theory of Secret Sharing , 1991 .

[9]  Douglas R. Stinson,et al.  Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[10]  Ingemar Ingemarsson,et al.  A Construction of Practical Secret Sharing Schemes using Linear Block Codes , 1992, AUSCRYPT.

[11]  Marten van Dijk.  On the information rate of perfect secret sharing schemes , 1995, Des. Codes Cryptogr..

[12]  WEN-AI JACKSON,et al.  Perfect Secret Sharing Schemes on Five Participants , 1996, Des. Codes Cryptogr..

[13]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[14]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[15]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[16]  Marten van Dijk,et al.  A General Decomposition Construction for Incomplete Secret Sharing Schemes , 1998, Des. Codes Cryptogr..

[17]  Keith M. Martin,et al.  Geometric secret sharing schemes and their duals , 1994, Des. Codes Cryptogr..

[18]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[19]  Douglas R Stinson,et al.  Some improved bounds on the information rate of perfect secret sharing schemes , 1990, Journal of Cryptology.