Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups

Takaaki Mizuki, Takao Nishizeki

研究成果: Article査読

2 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)333-345
ページ数13
ジャーナルIEICE Transactions on Information and Systems
E85-D
2
出版ステータスPublished - 2002 2

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能

引用スタイル