Tight Bounds on the Information Rate of Secret Sharing Schemes

A secret sharing scheme is a protocol by means of which a dealer distributes a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P, non-qualified to know s, cannot determine anything about the value of the secret.In this paper we provide a general technique to prove upper bounds on the information rate of secret sharing schemes. The information rate is the ratio between the size of the secret and the size of the largest share given to any participant. Most of the recent upper bounds on the information rate obtained in the literature can be seen as corollaries of our result. Moreover, we prove that for any integer d there exists a d-regular graph for which any secret sharing scheme has information rate upper bounded by 2/(d+1). This improves on van Dijk's result dik and matches the corresponding lower bound proved by Stinson in [22].

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

[2]  László Csirmaz,et al.  The Size of a Share Must Be Large , 1994, Journal of Cryptology.

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

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

[5]  Alfredo De Santis,et al.  Randomness in Distributed Protocols , 1994 .

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

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

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

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

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

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

[12]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

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

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

[15]  Alfredo De Santis,et al.  New bounds on the information rate of secret sharing schemes , 1995, IEEE Trans. Inf. Theory.

[16]  Alfredo De Santis,et al.  On Secret Sharing Schemes , 1998, Inf. Process. Lett..

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