Generalized Linear Threshold Scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 196 LNCS, Issue , 1985, Pages 231-241

  Kothari, S C ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS;

BASIC PRINCIPLES; MULTIPLE THRESHOLD; THRESHOLD SCHEMES;

CRYPTOGRAPHY;

EID: 85023433586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39568-7_19     Document Type: Conference Paper

References (9)

1. Blakely G.R., “Safeguarding Cryptographic Keys”, Proceeding of the National Computer Conference, 1979, AFIPS Conference Proceedings, Vol. 48 (1979), pp. 313-317.
2. 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.
3. Bloom J.R., “A Note on Superfast Threshold Schemes”, Preprint Texas A&M University, Department of Mathematics (1981).
4. Diffie W. and Heilman, M.E., “New Directions in Cryptography”, IEEE Trans. Inform. Theory, Vol. IT-22, No. 6, November 1976, pp. 644-654.
5. Kamin, Greene and Heilman, “On Secret Sharing Systems”, IEEE Transactions on Information Theory, Vol. IT-29, (1983), pp. 35-41.
6. Kuiper, “Linear Algebra and Geometry”, North-Holland Publishing CompanyAmsterdam, Second Edition, 1965.
7. 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.
8. Shamir A., “How to Share a Secret”, Communications of the ACM, Vol. 22, No. 11, Nov. 1979, pp. 612-613.
9. Shannon C.E., “Communication Theory of Secrecy Systems”, Bell System Technical Journal, 1948, pp. 656-715.