TY - GEN
T1 - Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts)
AU - Mizuki, Takaaki
AU - Nishizeki, Takao
PY - 2001
Y1 - 2001
N2 - 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 socalled 2-level key set protocol. In this paper we give a necessary and su.cient condition for the 2-level key set protocol to succeed.
AB - 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 socalled 2-level key set protocol. In this paper we give a necessary and su.cient condition for the 2-level key set protocol to succeed.
UR - http://www.scopus.com/inward/record.url?scp=70350650124&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350650124&partnerID=8YFLogxK
U2 - 10.1007/3-540-45678-3_18
DO - 10.1007/3-540-45678-3_18
M3 - Conference contribution
AN - SCOPUS:70350650124
SN - 3540429859
SN - 9783540429852
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 196
EP - 207
BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001
Y2 - 19 December 2001 through 21 December 2001
ER -