Abstract
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.
In this paper, we first prove that ¦V i ¦ >-¦Ŝ¦ for any distribution of S by using a combinatorial argument. This is a more sharp lower bound on ¦V i ¦ for not uniformly distributed S. Our proof makes it intuitively clear why ¦V i ¦ must be so large, also. Further, we show an extension of our combinatorial technique for some access structures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.R.Blakley: Safeguarding cryptographic keys. Proc. of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)
A.Shamir: How to share a secret. Communications of the ACM, 22, (11), pp. 612–613 (1979)
R.M.Capocelli, A.De Santis, L.Gargano, U.Vaccaro: On the size of shares for secret sharing schemes. Crypto'91, pp.101–113 (1991)
E.D.Karnin, J.W.Green, M.E.Hellman: On secret sharing systems. IEEE Trans. IT-29, No.1, pp. 35–41 (1982)
E.F.Brickell, D.M.Davenport: On the classification of ideal secret sharing schemes. Journal of Cryptology, vol. 4, No.2, pp. 123–134 (1991)
E.F.Brickell, D.R.Stinson: Some improved bounds on the information rate of perfect secret sharing schemes. Journal of Cryptology, vol. 5, No.3, pp. 153–166 (1992)
C.Blund, A.De Santis, D.R.Stinson, U.Vaccaro: Graph decomposition and secret sharing schemes. Eurocrypt'92, pp.1–20 (1992)
Y.Frankel, Y.Desmedt: Classification of ideal homomorphic threshold schemes over finite Abelian groups. Eurocrypt'92, pp.21–29 (1992)
C.Blund, A.De Santis, L.Gargano, U.Vaccaro: On the information rate of secret sharing schemes. Crypto'92 (1992)
D.R.Stinson: New general bounds on the information rate of secret sharing schemes. Crypto'92 (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Okada, K. (1995). Combinatorial interpretation of secret sharing schemes. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000424
Download citation
DOI: https://doi.org/10.1007/BFb0000424
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59339-3
Online ISBN: 978-3-540-49236-8
eBook Packages: Springer Book Archive