Skip to main content

Generalized Secret Sharing and Monotone Functions

Part of the Lecture Notes in Computer Science book series (LNCS,volume 403)

Abstract

Secret Sharing from the perspective of threshold schemes has been well-studied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A, B. C, and D in such a way that either A together with B can reconstruct the secret or C together with D can reconstruct the secret, then threshold schemes (even with weighting) are provably insufficient.

This paper will present general methods for constructing secret sharing schemes for any given secret sharing function. There is a natural correspondence between the set of “generalized” secret sharing functions and the set of monotone functions, and tools developed for simplifying the latter set can be applied equally well to the former set.

Keywords

  • Monotone Function
  • Secret Sharing
  • Access Structure
  • Secret Share 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.

References

  1. Asmuth, C. and Bloom, J. “A Modular Approach to Key Safeguarding.” Texas A&M University, Department of Mathematics, College Station, TX (1980).

    Google Scholar 

  2. Benaloh, J. “Secret Sharing Homomorphism: Keeping Shares of a Secret Secret” Proc. Crypto’ 86, Santa Barbara, CA (Aug. 1986), 251–260. Published as Advances in Cryptology, ed. by A. Odlyzko in Lecture Notes in Computer Science, vol. 263, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1987).

    CrossRef  Google Scholar 

  3. Benaloh, J. “Verifiable Secret-Ballot Elections.” Ph.D. Thesis presented at Yale University (Sep. 1987).

    Google Scholar 

  4. Blakley, G. “Safeguarding Cryptographic Keys.” Proc. AFIPS 1979 National Computer Conference, New York, NY (June 1979), 313–317.

    Google Scholar 

  5. Feldman, P. “A Practical Scheme for Non-interactive Verifiable Secret Sharing.” Proc. 28thIEEE Symp. on Foundations of Computer Science, Los Angeles, CA (Oct. 1987), 427–437.

    Google Scholar 

  6. Ito, M., Saito, A., and Nishizeki, T. “Secret Sharing Scheme Realizing General Access Structure.” Proc. Glob. Com, (1987).

    Google Scholar 

  7. Kothari, S. “Generalized Linear Threshold Scheme.” Proc. Crypto’ 84, Santa Barbara, CA (Aug. 1984), 231–241. Published as Advances in Cryptology, ed. by G. Blakley and D. Chaum in Lecture Notes in Computer Science, vol. 196, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).

    Google Scholar 

  8. Shamir, A. “How to Share a Secret.” Comm. ACM 22, 11 (Nov. 1979), 612–613.

    MathSciNet  CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benaloh, J., Leichter, J. (1990). Generalized Secret Sharing and Monotone Functions. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_3

Download citation

  • DOI: https://doi.org/10.1007/0-387-34799-2_3

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97196-4

  • Online ISBN: 978-0-387-34799-8

  • eBook Packages: Springer Book Archive