Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information and Communications Security

ICICS 1997: Information and Communications Security pp 81–86Cite as

Secret sharing in hierarchical groups

  • Session 2: Secret Sharing
  • Conference paper
  • First Online:

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

Abstract

We introduce the idea of hierarchical delegation within a secret sharing scheme and consider solutions with both conditional and unconditional security.

This work done while the author was at Department of Pure Mathematics, The University of Adelaide, Adelaide, SA 5005, AUSTRALIA

Support for this project was provided in part by the Australian Research Council under the reference number A49530480 and the 1995 ATERB grant

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Proceedings of CRYPTO'88, Lecture Notes in Computer Science, Advances in Cryptology, 403:27–35, 1990.

    Google Scholar 

  2. M. Bertilsson and I. Ingemarsson.A construction of practical secret sharing schemes using linear block codes. Advances in Cryptology — AUSCRYPT'92, Lecture Notes in Computer Science, J. Seberry and Y. Zheng (Eds), 718:67–79, 1993.

    Google Scholar 

  3. C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Advances in Cryptology — CRYPTO'93, Lecture Notes in Computer Science, 773:110–125, 1994.

    Google Scholar 

  4. C. Charnes, J. Pieprzyk, and R. Safavi-Naini. Conditionally secure secret sharing schemes with disenrollment capability. In Proceedings of the 2nd ACM Conference on Computer and Communication Security, November 2–4, 1994, Fairfax, Virginia, pages 89–95, 1994.

    Google Scholar 

  5. Y. Desmedt. Threshold cryptography. ETT, 5(4):449–457, August 1994.

    Google Scholar 

  6. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6):644–654, November 1976.

    Article  Google Scholar 

  7. H. Ghodosi, J. Pieprzyk, C. Charnes, and R. Safavi-Naini. Cryptosystems for hierarchical groups. Information Security and Privacy — ACISP'96, Lecture Notes in Computer Science, 1172:275–286, Springer 1996

    Google Scholar 

  8. I. Ingemarsson and G.J. Simmons. The consequences of trust in shared secret schemes. Advances in Cryptology — EUROCRYPT'90, Lecture Notes in Computer Science, 473:266–282, Springer 1991.

    Google Scholar 

  9. M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In Proceedings of Global Telecommunications Conf., Globecom'87, pages 99–102. IEEE Communications Soc. Press, 1987.

    Google Scholar 

  10. W.A. Jackson, K.M. Martin, and C.M. O'Keefe. Efficient secret sharing without a mutually trusted authority. Advances in Cryptology — EUROCRYPT'95, Lecture Notes in Computer Science, 921:183–193, 1995.

    Google Scholar 

  11. Hung-Yu Lin and Lein Harn. A generalized secret sharing scheme with cheater detection. In Advances in Cryptology — ASIACRYPT'91, Lecture Notes in Computer Science (H. Imai, R.L. Rivest and T. Matsumoto (Eds)), pages 149–158. Springer-Verlag, 1993. Fujiyoshida, Yamanashi, Japan, November 11–14, 1991.

    Google Scholar 

  12. K.M. Martin. Untrustworthy participants in perfect secret sharing schemes. In Cryptography and Coding III, pages 255–264. Oxford University Press, 1993.

    Google Scholar 

  13. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Proceedings of CRYPTO'91, Lecture Notes in Computer Science, Advances in Cryptology, 576:129–140, 1992.

    Google Scholar 

  14. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, November 1979.

    Article  Google Scholar 

  15. G.J. Simmons (Ed). Contemporary Cryptology — The Science of Information Integrity. IEEE Press, New York, 1992.

    Google Scholar 

  16. G.J. Simmons. The consequences of trust in shared secret schemes. Advances in Cryptology — EUROCRYPT'93, Lecture Notes in Computer Science, 765:448–452, 1994.

    Google Scholar 

  17. G.J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bulletin of the ICA, 1:71–88, 1991.

    Google Scholar 

  18. D.R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography, 2:357–390, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Centre for Computer Security Research, University of Wollongong, 2500, Wollongong, Australia

    Chris Charnes, Josef Pieprzyk & Rei Safavi-Nainil

  2. Dept Elektrotechniek-ESAT, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium

    Keith Martin

Authors
  1. Chris Charnes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rei Safavi-Nainil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag

About this paper

Cite this paper

Charnes, C., Martin, K., Pieprzyk, J., Safavi-Nainil, R. (1997). Secret sharing in hierarchical groups. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028464

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63696-0

  • Online ISBN: 978-3-540-69628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation