On sharing many secrets

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


We consider secret sharing schemes which, through an initial issuing of shares to a group of participants, permit a number of different secrets to be protected. Each secret is associated with a (potentially different) access structure and a particular secret can be reconstructed by any group of participants from its associated access structure without the need for further broadcast information. Two distinct problems are addressed. Firstly we consider ideal secret sharing schemes in this more general environment. In particular, we classify the collections of access structures that can be combined in such an ideal secret sharing scheme and we provide a general method of construction for such schemes. We also explore the extent to which the results that connect ideal secret sharing schemes to matroids can be appropriately generalised. Secondly we consider secret sharing schemes that can be used more than once. This problem can be considered as a type of secret sharing scheme wi! th different secrets but with the same access structure for each of the secrets.


Access Structure Sharing Scheme Probability Mass Function Secret Sharing Scheme Threshold Scheme 
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.
    I. Anderson: A first course in combinatorial mathematics, Clarendon Press, Oxford, 1989.Google Scholar
  2. 2.
    A. Beimel and B. Chor: Universally ideal secret sharing schemes. Adv. in Cryptology —CRYPTO'92, Lecture Notes in Comput. Sci, 740:183–195, 1993.Google Scholar
  3. 3.
    Th. Beth, D. Jungnickel and H. Lenz: Design Theory, Bibliographisches Institut, Mannheim, 1985.Google Scholar
  4. 4.
    G. R. Blakley: Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference 48 313–317, 1979.Google Scholar
  5. 5.
    R. Blom: An optimal class of symmetric key generation systems. Adv. in Cryptology —EUROCRYPT'84, Lecture Notes in Comput. Sci., 209:335–338, 1984.Google Scholar
  6. 6.
    C. Blundo and A. Cresti: Space requirements for broadcast encryption. Presented at EUROCRYPT'94, 1994.Google Scholar
  7. 7.
    C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro: Fully dynamic secret sharing schemes. Adv. in Cryptology — CRYPTO'93, Lecture Notes in Comput. Sci., 773:110–125, 1994.Google Scholar
  8. 8.
    C. Blundo, A. De Santis, A. Herzberg, S. Kutten, Perfectly-secure key distribution for dynamic conferences. Adv. in Cryptology —CRYPTO'92, Lecture Notes in Comput. Sci., 740:471–486, 1993.Google Scholar
  9. 9.
    C. Blundo, A. De Santis and U. Vaccaro: Efficient Sharing of Many Secrets. Proceedings of STACS '93, Lecture Notes in Comput. Sci. 665 692–703, 1993.Google Scholar
  10. 10.
    E. F. Brickell: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput., 9:105–113, 1989.Google Scholar
  11. 11.
    E. F. Brickell and D. M. Davenport: On the Classification of Ideal Secret Sharing Schemes. J. Cryptology 2 123–134, 1991.Google Scholar
  12. 12.
    E. F. Brickell and D. R. Stinson: Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptology 2 153–166, 1992.Google Scholar
  13. 13.
    R. A. Croft and S. P. Harris: Public-Key Cryptography and Re-usable Shared Secrets. Cryptography and Coding, H. J. Beker and F. C. Piper, Eds. Clarendon Press 255–268, 1989.Google Scholar
  14. 14.
    L. Harn and H.-Y. Lin: An l-Span Generalized Secret Sharing Scheme. Proceedings of Crypto '92, Lecture Notes in Comput. Sci., 740:558–565, 1993.Google Scholar
  15. 15.
    W.-A. Jackson and K. M. Martin: Combinatorial Models for Perfect Secret Sharing Schemes. J. Comb. Math. Comb. Comput., to appear.Google Scholar
  16. 16.
    W.-A. Jackson, K. M. Martin, and C. M. O'Keefe: A construction for multisecret threshold schemes. Submitted, 1993.Google Scholar
  17. 17.
    W.-A. Jackson, K. M. Martin, and C. M. O'Keefe: Multisecret threshold schemes. Adv. in Cryptology —CRYPTO'93, Lecture Notes in Comput. Sci., 773:126–135, 1994.Google Scholar
  18. 18.
    E. D. Karnin, J. W. Greene and M. E. Hellman: On Secret Sharing Systems. IEEE Trans. Inf. Theory Vol IT-29 1 35–41, 1983.Google Scholar
  19. 19.
    K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii: Nonperfect Secret Sharing Schemes and Matroids. Adv. in Cryptology —EUROCRYPT'93, Lecture Notes in Comput. Sci., 765:126–141, 1994.Google Scholar
  20. 20.
    K. M. Martin: New Secret Sharing Schemes from Old. J. Comb. Math. Comb. Comput. 14 65–77, 1993.Google Scholar
  21. 21.
    T. Matsumoto and H. Imai: On the key predistribution system: a practical solution to the key distribution problem. Adv. in Cryptology —CRYPTO'87, Lecture Notes in Comput. Sci., 293:185–193, 1988.Google Scholar
  22. 22.
    J. G. Oxley: Matroid Theory. Oxford University Press, Oxford, 1992.Google Scholar
  23. 23.
    P. D. Seymour: On secret-sharing matroids. J. Combin. Theory Ser B, 56:69–73, 1992.Google Scholar
  24. 24.
    A. Shamir: How to Share a Secret. Comm. ACM Vol 22 11 612–613, 1979.Google Scholar
  25. 25.
    G. J. Simmons: An Introduction to Shared Secret and/or Shared Control Schemes and their Application. Contemporary Cryptology: The Science of Information Integrity, IEEE Press, 1992.Google Scholar
  26. 26.
    D. R. Stinson: An Explication of Secret Sharing Schemes. Des. Codes Cryptogr. 2 357–390, 1992.Google Scholar
  27. 27.
    T. Uehara, T. Nishizeki, and K. Nakamura: A secret sharing system with matroidal access structure. Trans. IECE Japan, J69-A 9:1124–1132, 1986.Google Scholar
  28. 28.
    D. Welsh: Codes and Cryptography. Clarendon Press, Oxford, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  1. 1.Department of Pure MathematicsThe University of AdelaideAdelaideAustralia

Personalised recommendations