Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

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

9 Citations (Scopus)

Abstract

Using a random deal of cards to players and a computation- ally unlimited eavesdropper, all players wish to share a one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by a protocol to make several pairs of players share one-bit se- cret keys so that all these pairs form a spanning tree over players. In this paper we obtain a necessary and suficient condition on the number of cards for the existence of such a protocol. Our condition immediately yields an eficient linear-time algorithm to determine whether there exists a protocol to achieve such a secret key sharing.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
EditorsJacques Stern
PublisherSpringer Verlag
Pages389-401
Number of pages13
ISBN (Print)3540658890, 9783540658894
DOIs
Publication statusPublished - 1999
Event7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 - Prague, Czech Republic
Duration: 1999 May 21999 May 6

Publication series

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

Other

Other7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999
CountryCzech Republic
CityPrague
Period99/5/299/5/6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key'. Together they form a unique fingerprint.

Cite this