Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E85-D No.2 pp.333-345
- Publication Date
- 2002/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takaaki MIZUKI, Takao NISHIZEKI, "Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 2, pp. 333-345, February 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_2_333/_p
Copy
@ARTICLE{e85-d_2_333,
author={Takaaki MIZUKI, Takao NISHIZEKI, },
journal={IEICE TRANSACTIONS on Information},
title={Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups},
year={2002},
volume={E85-D},
number={2},
pages={333-345},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
T2 - IEICE TRANSACTIONS on Information
SP - 333
EP - 345
AU - Takaaki MIZUKI
AU - Takao NISHIZEKI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2002
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 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.
ER -
English
