Multiple Assignment Scheme For Sharing Secret

Please, wait while we are validating your browser

  • [1]

    D. E. Denning,Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983.Google Scholar

  • [2]

    K. Koyama, Cryptographic key sharing methods for multi-groups and security analysis,Trans. IECE JapanE66,1 (1983), 13–20.Google Scholar

  • [3]

    A. Shamir, How to share a secret,Comm. ACM22 (1979), 612–613.MATHCrossRefMathSciNetGoogle Scholar

  • [4]

    E. Sperner, Ein Sats über Untermengen einer endlichen Menge,Math. Z.27 (1928), 544–548.CrossRefMathSciNetGoogle Scholar

  • [5]

    D. R. Stinton and S. A. Vanstone, A combinatorial approach to threshold scheme,Advances in Cryptology—Proceedings Crypto ’87 (C. Pomerrance, ed.), Lecture Notes in Computer Science, Vol. 293, Springer-Verlag, Berlin, 1988, pp. 330–339.Google Scholar

  • [6]

    T. Uehara, T. Nishizeki, E. Okamoto, and K. Nakamura, Secret sharing systems with matroidal schemes,Trans. IECE JapanJ68-A,9 (1986), 1124–1132.Google Scholar

  • [7]

    H. Yamamoto, On secret sharing systems using (k, L, n)-threshold scheme,Trans. IECE JapanJ68-A,9 (1985), 945–952.Google Scholar

  • 0 Replies to “Multiple Assignment Scheme For Sharing Secret”

    Lascia un Commento

    L'indirizzo email non verrà pubblicato. I campi obbligatori sono contrassegnati *