Characterization of optimal key set protocols

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Research output: Contribution to journalConference articlepeer-review

8 Citations (Scopus)


Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocols. In this paper, we give a necessary and sufficient condition for a key set protocol to be "optimal", that is, to succeed always in sharing a one-bit secret key.

Original languageEnglish
Pages (from-to)213-236
Number of pages24
JournalDiscrete Applied Mathematics
Issue number1
Publication statusPublished - 2003 Sep 6
Event2nd International Colloquium - Metz, France
Duration: 2000 May 222000 May 24


  • Card game
  • Key exchange graph
  • Key set protocol
  • Secret key exchange
  • Tree

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Characterization of optimal key set protocols'. Together they form a unique fingerprint.

Cite this