Abstract
We will present an extension of Shamir’s threshold scheme (Shamir 1979). Shamir’s scheme demonstrates how to divide a master key D into n pieces so that it is easily reconstructed from any k pieces, where even complete knowledge of k — 1 pieces reveals nothing about D. Shamir calls it a (k,n) threshold scheme. We propose a method that enables the creation of hierarchical information threshold schemes with s security levels, so that k l partial keys (shares) are required for computation of a master key D l for level l. The higher the security level, the more partial keys required. We call our scheme a (k l , s,n) multithreshold scheme, l =1,…,s.
Chapter PDF
Similar content being viewed by others
Keywords
References
Asmuth, C.A., Blakley, G.R. (1982) Pooling, splitting and reconstructing information to overcome total failure on some channels of communication. Proc. IEEE Computer Society 1982 Symp. on Security and Privacy, 156–169.
Asmuth, C., Bloom, J. (1983) A Modular Approach to Key Safeguarding. IEEE Transactions on Information Theory, IT-3O, 208–10.
Beutelspacher, A. (1988) Enciphered geometry: Some applications of geometry to cryptography. Annals of Discrete Mathematics, 37, 59–68, North Holland
Beutelspacher, A. (1990) How to say ‘no’. Proceedings of Eurocrypt’89, 491–6, Springer Verlag. Berlin
Beutelspacher, A., Vedder, K. (1987) Geometric Structures as threshold schemes. Proceedings of the 1987 IMA Conf. on Cryptography and Coding Theory, Cirencester ( England ), Oxford University Press
Blakley, G.R. (1979) Safeguarding Cryptographic Keys. Proceeding of AFIPS 1979 Nat. Comp. Conf., 48, 313–7
Davida, G.I., DeMillo, R.A., Lipton, J.R. (1980) Protecting shared cryptographic keys. Proc. IEEE Computer Society 1980 Symp. on Security and Privacy, 100–2, Oakland ( California, USA )
Erickson, D.L. (1993) Threshold Schemes with Hierarchical Information. Technical Report 9323, University of Waterloo, Ontario (Canada)
Harari, S. (1983) Secret Sharing Systems Springer Verlag, 105–10, Vienna (Austria)
Kamin, E.D., Greene, J.W., Hellman, M.E. (1983) On Sharing Secret Systems. IEEE Transactions on Information Theory IT-29, 35–41
Mignotte, M. (1983) How to share a secret. Cryptography, 371–5
Shamir, A. (1979) How to Share a Secret Comm. ACM, 22, 612–3
Simmons, G.J. (1989) How to (Really) Share a Secret. Proceedings of Crypto’88, 390–448
Simmons, G.J. (1990) Prepositioned Shared Secret and/or Shared Control Schemes. Proceedings of Eurocrypt’89, 436–67
Simmons, G.J. (1991) Geometric Shared Secret and/or Shared Control Schemes. Proceedings of Crypto’90, 216–41
Simmons, G.J., ed. (1992) Contemporary Cryptology IEEE Press
Stinston, D.R., Vanstone, S.A. (1988) A combinatorial approach to threshold schemes. Siam J.Disc.Math., 1. 230–6
The digital signature standard (1992) Comm. ACM, 35, 36–40
Tompa, M., Woll, H. (1986) How to share a secret with cheaters. Proceedings of Crypto ’86, 261–5, Springer Verlag, Berlin
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Hassler, H., Hassler, V., Posch, R. (1996). An Hierarchical Threshold Scheme with Unique Partial Keys. In: Katsikas, S.K., Gritzalis, D. (eds) Information Systems Security. SEC 1996. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-1-5041-2919-0_19
Download citation
DOI: https://doi.org/10.1007/978-1-5041-2919-0_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2921-3
Online ISBN: 978-1-5041-2919-0
eBook Packages: Springer Book Archive