Skip to main content
SpringerLink
Log in

Secret sharing in multilevel and compartmented groups

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1998)

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

Included in the following conference series:

Abstract

The paper proposes efficient solutions to two long standing open problems related to secret sharing schemes in multilevel (or hierarchical) and compartmented access structures. The secret sharing scheme in multilevel access structures uses a sequence of related Shamir threshold schemes with overlapping shares and the secret. The secret sharing scheme in compartmented access structures applies Shamir schemes first to recover partial secrets and second to combine them into the requested secret. Both schemes described in the paper are ideal and perfect.

Support for this project was provided in part by the Australian Research Council under the reference number A49530480.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Blakley, “Safeguarding cryptographic keys,” in Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317, 1979.

    Google Scholar 

  2. E. Brickell, “Some Ideal Secret Sharing Schemes,” in Advances in Cryptology — Proceedings of EUROCRYPT '89 (J.-J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 468–475, Springer-Verlag, 1990.

    Google Scholar 

  3. M. Ito, A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure,” in Proceedings IEEE Global Telecommun. Conf., Globecom '87, Washington, pp. 99–102, IEEE Communications Soc. Press, 1987.

    Google Scholar 

  4. S. Kothari, “Generalized Linear Threshold Scheme,” in Advances in Cryptology — Proceedings of CRYPTO '84 (G. Blakley and D. Chaum, eds.), vol. 196 of Lecture Notes in Computer Science, pp. 231–241, Springer-Verlag, 1985.

    Google Scholar 

  5. A. Shamir, “How to Share a Secret,” Communications of the ACM, vol. 22, pp. 612–613, Nov. 1979.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Simmons, “How to (Really) Share a Secret,” in Advances in Cryptology — Proceedings of CRYPTO '88 (S. Goldwasser, ed.), vol. 403 of Lecture Notes in Computer Science, pp. 390–448, Springer-Verlag, 1990.

    Google Scholar 

  7. D. Stinson, “An Explication of Secret Sharing Schemes,” Designs, Codes and Cryptography, vol. 2, pp. 357–390, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Security Research School of Information Technology and Computer Science, University of Wollongong, 2522, Wollongong, NSW, Australia

    Hossein Ghodosi, Josef Pieprzyk & Rei Safavi-Naini

Authors
  1. Hossein Ghodosi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rei Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd Ed Dawson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghodosi, H., Pieprzyk, J., Safavi-Naini, R. (1998). Secret sharing in multilevel and compartmented groups. In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053748

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64732-4

  • Online ISBN: 978-3-540-69101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation