Multi dimensional compartment schemes

  • Johannes Maucher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1355)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.R. Blakely: Safeguarding Kryptographic Keys, Proc. AFIPS 1979 Nail. Computer Conf., New York, vol. 48, pp.313–317, June 1979.Google Scholar
  2. [2]
    E.F. Brickell: Some Ideal Secret Sharing Schemes, J. Combin. Math. and Combin. Comput., 9, pp. 105–113, 1989.Google Scholar
  3. [3]
    A. Shamir: How to Share a Secret, Massachusetts Institute of Technology, Technical Report MIT/LCS/TM-131,, May 1979.Google Scholar
  4. [4]
    G.J. Simmons: An Introduction to Shared Secret and/or Shared Control Schemes and their Application, Contemporary Cryptology, IEEE Press, pp. 441–497, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Johannes Maucher
    • 1
  1. 1.Dept. of Information TechnologyUniversity of UlmGermany

Personalised recommendations