Graph Decompositions and Secret Sharing Schemes

In this paper, we continue a study of secret sharing schemes for access structures based on graphs. Given a graph G, we require that a subset of participants can compute a secret key if they contain an edge of G otherwise, they can obtain no information regarding the key. We study the information rate of such schemes, which measures how much information is being distributed as shares as compared to the size of the secret key, and the average information rate, which is the ratio between the secret size and the arithmetic mean of the size of the shares. We give both upper and lower bounds on the optimal information rate and average information rate that can be obtained. Upper bounds arise by applying entropy arguments due to Capocelli et al [10]. Lower bounds come from constructions that are based on graph decompositions. Application of these constructions requires solving a particular linear programming problem. We prove some general results concerning the information rate and average information rate for paths, cycles and trees. Also, we study the 30 (connected) graphs on at most five vertices, obtaining exact values for the optimal information rate in 26 of the 30 cases, and for the optimal avebage information rate in 28 of the 30 cases.

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

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

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

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

[5]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

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

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

[8]  Paul D. Seymour.  On secret-sharing matroids , 1992, J. Comb. Theory, Ser. B.

[9]  Gustavus J. Simmons,et al.  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party , 1991, EUROCRYPT.

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

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

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

[13]  Alfredo De Santis,et al.  On the Size of Shares for Secret Sharing Schemes , 1991, CRYPTO.

[14]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

[15]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Gustavus J. Simmons.  Geometric Shared Secret and/or Shared Control Schemes , 1990, CRYPTO.

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

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