论文信息 - Combinatorial Interpretation of Secret Sharing Schemes

Combinatorial Interpretation of Secret Sharing Schemes

In a perfect secret sharing scheme, it is known that log2 ¦V i ¦ ≥H(S), where S is a secret and V i is the share of user i. On the other hand, log2 ¦Ŝ¦ ≥H(S), where Ŝ is the domain of S. The equality holds if and only if S is uniformly distributed. Therefore, if S is uniformly distributed, we have ¦V i ¦≥¦Ŝ¦. However, if S is not uniformly distributed, log2 ¦Ŝ¦> H(S). In this case, we have log2¦V i ¦≥H(S) <log2¦Ŝ¦. Then, which is bigger, ¦Vi¦ or ¦Ŝ¦? The answer is not known.

Kaoru Kurosawa | Koji Okada | K. Kurosawa | K. Okada

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

[2] Yvo Desmedt,et al. Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract) , 1992, EUROCRYPT.

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

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

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

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

[7] Alfredo De Santis,et al. On the Information Rate of Secret Sharing Schemes (Extended Abstract) , 1992, CRYPTO.

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