Presentation 1995/9/20
Algorithm for Concurrent Use of Plural Key Sharing Systems
Tsutomu Matsumoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Assuming a set of v entities and a set B of b key-sharing systems, this paper proposes an efficient algorithm to assign each entity a r-subset of B so that any two entities have at least one common key-sharing system with which they can share a common key. This work complements the results given in T. Matsumoto, "Incidence structures for key sharing," Advances in Cryptology : Proceedings of ASIACRYPT'94, Lecture Notes in Computer Science No. 917, pp. 342-353, Springer-Verlag, 1995.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Binary Matrix / Cryptography / Identifier / Incidence Structure / Key Distribution / Key Sharing / Tactical Configuration / Tamper Resistant Module
Paper #
Date of Issue

Conference Information
Committee ISEC
Conference Date 1995/9/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Algorithm for Concurrent Use of Plural Key Sharing Systems
Sub Title (in English)
Keyword(1) Binary Matrix
Keyword(2) Cryptography
Keyword(3) Identifier
Keyword(4) Incidence Structure
Keyword(5) Key Distribution
Keyword(6) Key Sharing
Keyword(7) Tactical Configuration
Keyword(8) Tamper Resistant Module
1st Author's Name Tsutomu Matsumoto
1st Author's Affiliation Division of Electrical and Computer Engineering Yokohama National University()
Date 1995/9/20
Paper #
Volume (vol) vol.95
Number (no) 240
Page pp.pp.-
#Pages 10
Date of Issue