Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts)

Takaaki Mizuki; Takao Nishizeki

doi:10.1007/3-540-45678-3_18

Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts)

Takaaki Mizuki, Takao Nishizeki

Research and Development Divisions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 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.

Original language	English
Title of host publication	Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages	196-207
Number of pages	12
DOIs	https://doi.org/10.1007/3-540-45678-3_18
Publication status	Published - 2001 Dec 1
Event	12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand Duration: 2001 Dec 19 → 2001 Dec 21

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2223 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	12th International Symposium on Algorithms and Computation, ISAAC 2001
Country	New Zealand
City	Christchurch
Period	01/12/19 → 01/12/21

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45678-3_18

Fingerprint Dive into the research topics of 'Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts)'. Together they form a unique fingerprint.

Cite this

Mizuki, T., & Nishizeki, T. (2001). Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts). In Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings (pp. 196-207). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_18

Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts). / Mizuki, Takaaki; Nishizeki, Takao.

Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. p. 196-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mizuki, T & Nishizeki, T 2001, Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts). in Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2223 LNCS, pp. 196-207, 12th International Symposium on Algorithms and Computation, ISAAC 2001, Christchurch, New Zealand, 01/12/19. https://doi.org/10.1007/3-540-45678-3_18

Mizuki T, Nishizeki T. Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts). In Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. p. 196-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45678-3_18

Mizuki, Takaaki ; Nishizeki, Takao. / Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts). Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. pp. 196-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b3fa88d85f814bee8f215bccd9395dc5,

title = "Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (Extended Abstracts)",

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 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.",

author = "Takaaki Mizuki and Takao Nishizeki",

year = "2001",

month = dec,

day = "1",

doi = "10.1007/3-540-45678-3_18",

language = "English",

isbn = "3540429859",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "196--207",

booktitle = "Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings",

note = "12th International Symposium on Algorithms and Computation, ISAAC 2001 ; Conference date: 19-12-2001 Through 21-12-2001",

}

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/12/1

Y1 - 2001/12/1

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 -