On the Information Rate of Secret Sharing Schemes (Extended Abstract)

We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs. We give the first proof of the existence of access structures with optimal information rate and optimal average information rate less that 1/2 + e, where e is an arbitrary positive constant. We also provide several general lower bounds on information rate and average information rate of graphs. In particular, we show that any graph with n vertices admits a secret sharing scheme with information rate Ω((log n)/n).

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

[2]  Gustavus J. Simmons,et al.  Prepositioned Shared Secret and/or Shared Control Schemes , 1990, EUROCRYPT.

[3]  Alfredo De Santis,et al.  Secret Sharing Schemes with Veto Capabilities , 1993, Algebraic Coding.

[4]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

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

[6]  Alfredo De Santis,et al.  Size of Shares and Probability of Cheating in Threshold Schemes , 1994, EUROCRYPT.

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

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

[9]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1993, Theor. Comput. Sci..

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

[11]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

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

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

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

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

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[18]  Zsolt Tuza,et al.  Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices , 1984, Comb..

[19]  Keith M. Martin,et al.  Multisecret Threshold Schemes , 1994, CRYPTO.

[20]  Giovanni Di Crescenzo,et al.  Multi-Secret Sharing Schemes , 1994, CRYPTO.

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

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

[23]  G. R. Blakley,et al.  Threshold Schemes with Disenrollment , 1992, CRYPTO.

[24]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

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

[26]  Ernest F. Brickell,et al.  The Detection of Cheaters in Threshold Schemes , 1990, SIAM J. Discret. Math..

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