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

Takaaki Mizuki, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages196-207
Number of pages12
DOIs
Publication statusPublished - 2001 Dec 1
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: 2001 Dec 192001 Dec 21

Publication series

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

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
CountryNew Zealand
CityChristchurch
Period01/12/1901/12/21

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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