Generalized Linear Threshold Scheme

  • S. C. Kothari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 196)


A generalized linear threshold scheme is introduced. The new scheme generalizes the existing linear threshold schemes. The basic principles involved in the construction of linear threshold schemes are laid out and the relationships between the existing schemes are completely established. The generalized linear scheme is used to provide a hierarchical threshold scheme which allows multiple thresholds necessary in a hierarchical environment.


Linear Variety Secret Sharing Scheme Threshold Scheme Affine Variety Linear Subvariety 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Blakely 79]
    Blakely G.R., “Safeguarding Cryptographic Keys”, Proceeding of the National Computer Conference, 1979, AFIPS Conference Proceedings, Vol. 48 (1979), pp. 313–317.Google Scholar
  2. [Blakely 81]
    Blakely G.R. and Laif Swanson, “Security Proofs for Information Protection Systems”, Proceedings of the 1981 symposium on Security and Privacy, IEEE Computer Society, 1981, pp. 75–88.Google Scholar
  3. [Bloom 81]
    Bloom J.R., “A Note on Superfast Threshold Schemes”, Preprint Texas A&M University, Department of Mathematics (1981).Google Scholar
  4. [Diffie 76]
    Diffie W. and Hellman, M.E.. “New Directions in Cryptography”, IEEE Trans. Inform. Theory, Vol. IT-22, No. 6, November 1976, pp. 644–654.CrossRefMathSciNetGoogle Scholar
  5. [Karnin 83]
    Karnin. Greene and Hellman, “On Secret Sharing Systems”, IEEE Transactions on Information Theory, Vol. IT-29, (1983), pp. 35–41.CrossRefMathSciNetGoogle Scholar
  6. [Kuiper 65]
    Kuiper, “Linear Algebra and Geometry”, North-Holland Publishing Company-Amsterdam, Second Edition, 1965.Google Scholar
  7. [Rivest 78]
    Rivest R.L., A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communications of the ACM, Vol. 21, 1978, pp. 120–126.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [Shamir 79]
    Shamir A.. “How to Share a Secret”, Communications of the Am, Vol. 22, No. 11, Nov. 1979, pp. 612–613.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [Shannon]
    Shannon C.E., “Communication Theory of Secrecy of Secrecy Systems”, Bell System Technical Journal, 1948, pp. 656–715.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • S. C. Kothari
    • 1
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA

Personalised recommendations