For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
Takaaki MIZUKI Takao NISHIZEKI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/02/01
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
card game, key exchange graph, key set protocol, secret key exchange, tree,
Full Text: PDF(395.6KB)>>
Suppose that there are players in two hierarchical groups and a computationally unlimited eavesdropper. Using a random deal of cards, a player in the higher group wishes to send a one-bit message information-theoretically securely either to all the players in her group or to all the players in the two groups. This can be done by the so-called 2-level key set protocol. In this paper we give a necessary and sufficient condition for the 2-level key set protocol to succeed.