New bounds on the information rate of secret sharing schemes

/spl acute/A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. We derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared to the size of the secret key, and the average information rate, that is the ratio between the secret size and the arithmetic mean of the size of the shares. By applying the substitution technique, we are able to construct many new examples of access structures where the information rate is bounded away from 1. The substitution technique is a method used to obtain a new access structure by replacing a participant in a previous structure with a new access structure. >

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

[2]  Alfredo De Santis,et al.  On the Information Rate of Secret Sharing Schemes , 1996, Theor. Comput. Sci..

[3]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

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

[6]  László Csirmaz.  The Size of a Share Must Be Large , 1994, EUROCRYPT.

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

[8]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[9]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[10]  Anna Gál,et al.  Lower bounds for monotone span programs , 1994, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[13]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

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

[15]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[16]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[17]  Amos Beimel,et al.  Universally ideal secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[18]  Suresh C. Kothari,et al.  Generalized Linear Threshold Scheme , 1985, CRYPTO.

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