Lower bound on the size of shares of nonperfect secret sharing schemes

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 917)


In a secret sharing scheme (SS), a dealer D distributes a piece of information V i of a secret S to each participant P i . If we desire that ¦V i ¦ < ¦S¦, a nonperfct SS must be used, in which there exists a semi-access set C that has some information on S, but cannot recover S. This paper first presents a general lower bound on ¦V i ¦ which includes the previous lower bounds for perfect SSs and nonperfect SSs as special cases. There exist, however, access hierarchies in which ¦V i ¦ must be larger than the general lower bound, of course. As our second contribution, we determine the optimum size of V i for such a certain access hierarchy.


Access Structure Sharing Scheme Secret Sharing Scheme General Access Structure Probabilistic Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G.R.Blakley: Safeguarding cryptographic keys. Proc. of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)Google Scholar
  2. 2.
    A.Shamir: How to share a secret. Journal of Cryptology, vol. 6, No.1, pp. 15–20 (1993)Google Scholar
  3. 3.
    M.Itoh, A.Saito and T.Nishizeki: Secret sharing scheme realizing general access structure. Proc. of IEEE Globecom '87, Tokyo, pp.99–102 (1987) Also, Multiple assignment scheme for sharing secret. Journal of Cryptology, vol.6, No.1, pp.15–20 (1993)Google Scholar
  4. 4.
    J.C.Benaloh and J.Leichter: Generalized secret sharing and monotone functions. Crypto'88, pp.27–36 (1990)Google Scholar
  5. 5.
    E.D.Karnin, J.W.Green and M.E.Hellman: On secret sharing systems. IEEE Trans. IT-29, No.1, pp. 35–41 (1982)Google Scholar
  6. 6.
    G.R.Blakeley and C.Meadows: Security of ramp schemes. Crypto'84, pp.242–268 (1984)Google Scholar
  7. 7.
    E.F.Brickell and D.M.Davenport: On the classification of ideal secret sharing schemes. Journal of Cryptology, vol. 4, No.2, pp. 123–134 (1991)Google Scholar
  8. 8.
    R.M.Capocelli, A.De Santis, L.Gargano and U.Vaccaro: On the size of shares for secret sharing schemes. Crypto'91, pp.101–113 (1991)Google Scholar
  9. 9.
    E.F.Brickell and D.R.Stinson: Some improved bounds on the information rate of perfect secret sharing schemes. Crypto'90, pp.242–252 (1990)Google Scholar
  10. 10.
    C.Blund, A.De Santis, D.R.Stinson and U.Vaccaro: Graph decomposition and secret sharing schemes. Eurocrypt'92, pp.1–20 (1992)Google Scholar
  11. 11.
    C.Blund, A.De Santis, L.Gargano and U.Vaccaro: On the information rate of secret sharing schemes. Crypto'92 (1992)Google Scholar
  12. 12.
    D.R.Stinson: New general bounds on the information rate of secret sharing schemes. Crypto'92 (1992)Google Scholar
  13. 13.
    M.Franklin and M.Yung: Communication complexity of secure computation. STOC'92, pp.699–710 (1992)Google Scholar
  14. 14.
    C.Blund, A.De Santis and U.Vaccaro: Efficient sharing of many secrets. STACS'93, pp.692–703 (1993)Google Scholar
  15. 15.
    W.Ogata, K.Kurosawa and S.Tsujii: Nonperfect secret sharing schemes. Auscrypt'92 (1992)Google Scholar
  16. 16.
    K.Kurosawa, K.Okada, K.Sakano, W.Ogata and S.Tsujii: Nonperfect secret sharing schemes and matroids. Eurocrypt'93 (1993)Google Scholar
  17. 17.
    R.G.Gallager: Information Theory and Reliable Communications. John Wiley & Sons, New York, NY (1968)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  1. 1.Department of Electrical and Electronic Engineering, Faculty of EngineeringTokyo Institute of TechnologyTokyoJapan

Personalised recommendations