论文信息 - Decomposition constructions for secret-sharing schemes

Decomposition constructions for secret-sharing schemes

The paper describes a very powerful decomposition construction for perfect secret-sharing schemes. The author gives several applications of the construction and improves previous results by showing that for any graph G of maximum degree d, there is a perfect secret-sharing scheme for G with information rate 2/(d+1). As a corollary, the maximum information rate of secret-sharing schemes for paths on more than three vertices and for cycles on more than four vertices is shown to be 2/3. >

Douglas R. Stinson | D. Stinson

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

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

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

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

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

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

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

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

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

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

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

[12] Gustavus J. Simmons,et al. An Introduction to Shared Secret and/or Shared Control Schemes and Their ApplicationThis work was performed at Sandia National Laboratories and supported by the U.S. Department of Energy under contract number DEAC0476DPOO789. , 1992 .