Multiple assignment scheme for sharing secret

Springer Science and Business Media LLC - 1993
Mitsuru Ito1, Akira Saito2, Takao Nishizeki3
1Mitsubishi Co., Kamimachiya 325, Kamakura-shi, 247, Kanagawa, Japan
2Department of Mathematics, Nihon University, Sakurajosui 3-25-40, Setagaya-ku, 156, Tokyo, Japan
3Department of Information Engineering, Faculty of Engineering, Tohoku University, 980, Sendai, Miyagi, Japan

Tóm tắt

Từ khóa


Tài liệu tham khảo

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

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

A. Shamir, How to share a secret,Comm. ACM 22 (1979), 612–613.

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

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.

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

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

Thông tin
Thông tin xuất bản

Springer Science and Business Media LLC

Thông tin tác giả