Abstract
We define a multi dimensional compartment scheme, which is a secret sharing scheme where each participant acts not only as a member of one party, but as a representative of one party on each dimension. The secret can be reconstructed whenever on each dimension at least one representative of a predetermined number of distinct parties contribute its private share. It is also shown how a non-complete multi dimensional compartment scheme can be realized.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.R. Blakely: Safeguarding Kryptographic Keys, Proc. AFIPS 1979 Nail. Computer Conf., New York, vol. 48, pp.313–317, June 1979.
E.F. Brickell: Some Ideal Secret Sharing Schemes, J. Combin. Math. and Combin. Comput., 9, pp. 105–113, 1989.
A. Shamir: How to Share a Secret, Massachusetts Institute of Technology, Technical Report MIT/LCS/TM-131,, May 1979.
G.J. Simmons: An Introduction to Shared Secret and/or Shared Control Schemes and their Application, Contemporary Cryptology, IEEE Press, pp. 441–497, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maucher, J. (1997). Multi dimensional compartment schemes. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024468
Download citation
DOI: https://doi.org/10.1007/BFb0024468
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63927-5
Online ISBN: 978-3-540-69668-1
eBook Packages: Springer Book Archive