Skip to main content
SpringerLink
Log in

Perfect secret sharing schemes on five participants

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A perfect secret sharing scheme is a system for the protection of a secret among a number of participants in such a way that only certain subsets of these participants can reconstruct the secret, and the remaining subsets can obtain no additional information about the secret. The efficiency of a perfect secret sharing scheme can be assessed in terms of its information rates. In this paper we discuss techniques for obtaining bounds on the information rates of perfect secret sharing schemes and illustrate these techniques using the set of monotone access structures on five participants. We give a full listing of the known information rate bounds for all the monotone access structures on five participants.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Adv. in Cryptology-CRYPTO '88, Lecture Notes in Computer Science, 403 (1990) pp. 27–35.

  2. G. R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) pp. 313–317.

    Google Scholar 

  3. C. Blundo, A De Santis, D. R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology, Vol. 8 (1995) pp. 39–64.

    Google Scholar 

  4. C. Blundo and A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes, Adv. in Cryptology-CRYPTO '92, Lecture Notes in Computer Science, 740 (1993) pp. 149–169.

  5. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 2 (1991) pp. 123–134.

    Google Scholar 

  6. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, Vol. 2 (1992) pp. 153–166.

    Google Scholar 

  7. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes. J. Cryptology, Vol. 6 (1993) pp. 157–167.

    Google Scholar 

  8. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A note on secret sharing schemes. In Sequences II: Methods in Communications, Security and Computer Science, pp. 335–344. Springer Verlag, 1993.

  9. M. van Dijk, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr., Vol. 6 (1995) pp. 143–169.

    Google Scholar 

  10. M. van Dijk, W.-A. Jackson and K. M. Martin, A general decomposition construction for incomplete secret sharing schemes, In preparation.

  11. R. G. Gallager, Information Theory and Reliable Communication. John Wiley and Sons, New York (1968).

    Google Scholar 

  12. J. W. P. Hirschfeld, Projective Geometries over Finite Fields. Clarendon Press, Oxford (1979).

    Google Scholar 

  13. M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure. Proceedings IEEE Global Telecom. Conf., GLOBECOM '87, IEEE Comm. Soc. Press, (1987) pp. 99–102.

  14. W.-A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Des. Codes Cryptogr., Vol. 4 (1994) pp. 83–95.

    Google Scholar 

  15. K. M. Martin, New secret sharing schemes from old, J. Combin. Math. Combin. Comput., Vol. 14 (1993) pp. 65–77.

    Google Scholar 

  16. A. Shamir, How to share a secret, Comm. ACM, Vol. 22, No. 11 (1979) pp. 612–613.

    Google Scholar 

  17. G. J. Simmons, W.-A. Jackson, and K. Martin, The geometry of shared secret schemes, Bull. Inst. Combin. Appl., Vol. 1 (1991) pp. 71–88.

    Google Scholar 

  18. D. R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 118–125.

    Google Scholar 

  19. D. R. Stinson, An explication of secret sharing schemes, Des. Codes Cryptogr., Vol. 2 (1992) pp. 357–390.

    Google Scholar 

  20. D. R. Stinson, New general lower bounds on the information rate of secret sharing schemes. Adv. in Cryptology-CRYPTO '92, Lecture Notes in Computer Science, 740 (1993) pp. 168–182.

  21. D. Welsh, Codes and Cryptography, Clarendon Press, Oxford (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, The University of Adelaide, 5005, Adelaide, SA, Australia

    Wen-Ai Jackson & Keith M. Martin

Authors
  1. Wen-Ai Jackson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith M. Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by: D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jackson, WA., Martin, K.M. Perfect secret sharing schemes on five participants. Des Codes Crypt 9, 267–286 (1996). https://doi.org/10.1007/BF00129769

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00129769

Keywords

Search

Navigation