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 informtion 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. R. Blom, An Optimal class of symmetric key generation systems. Advances in Cryptology-Eurocrypt '84, Lecture Notes in Computer Science, Vol. 209 (1984) 335–338.

    Google Scholar 

  2. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. Advances in Cryptology-Crypto '92, Lecture Notes in Computer Science, Vol. 740 (1993) 471–486.

    Google Scholar 

  3. J. W. P. Hirschfeld: Projective geometries over finite fields, Clarendon Press (1979).

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

    Google Scholar 

  5. W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. Multisecret threshold schemes. Advances in Cryptology-Crypto '93, Lecture Notes in Computer Science, Vol. 773 (1994) 126–135.

    Google Scholar 

  6. R. Lidl and H. Niederreiter: Finite Fields, Cambridge University Press, Cambridge (1983).

    Google Scholar 

  7. T. Matsumoto and H. Imai. On the key predistribution system: A practical solution to the key predistribution problem. Advances in Cryptology: Crypto '87, Lecture Notes in Computer Science, Vol. 293 (1987) 185–193.

    Google Scholar 

  8. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. Con-temporary Cryptology: The Science of Information Integrity, IEEE Press (1992).

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, The University of Adelaide, Adelaide, SA, 5005, 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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jackson, WA., Martin, K.M. Perfect Secret Sharing Schemes on Five Participants. Designs, Codes and Cryptography 9, 267–286 (1996). https://doi.org/10.1023/A:1027328505246

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027328505246

Search

Navigation