Characterization of optimal key set protocols (extended abstract)

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 protocol. In this paper we give a necessary and suficient condition for a key set protocol to be \optimal," that is, to succeed always in sharing a one-bit secret key.

Original languageEnglish
Title of host publicationTheoretical Computer Science
Subtitle of host publicationExploring New Frontiers of Theoretical Informatics - International Conference IFIP TCS 2000, Proceedings
EditorsJan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
PublisherSpringer Verlag
Pages273-285
Number of pages13
ISBN (Print)3540678239, 9783540678236
DOIs
Publication statusPublished - 2000
Event 1st IFIP International Conference on Theoretical Computer Science, TCS 2000 - Sendai, Japan
Duration: 2000 Aug 172000 Aug 19

Publication series

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

Conference

Conference 1st IFIP International Conference on Theoretical Computer Science, TCS 2000
CountryJapan
CitySendai
Period00/8/1700/8/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Characterization of optimal key set protocols (extended abstract)'. Together they form a unique fingerprint.

Cite this