Multiparty secret key exchange using a random deal of cards

Michael J. Fischer, Rebecca N. Wright

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

16 Scopus citations


We consider the problem of multiparty secret key exchange. A “team” of players P1 through Pk wishes to determine an n-bit secret key in the presence of a computationally unlimited eavesdropper, Eve. The team players are dealt hands of cards of prespecified sizes from a deck of d distinct cards; any remaining cards are dealt to Eve. We explore how the team can use the information contained in their hands of cards to determine an n-bit key that is secret from Eve, that is, an n bit string which each team player knows exactly but for which Eve’s probability of guessing the key correctly is 1/2n both before and after she hears the communication between the team players. We describe randomized protocols for secret key exchange that work for certain classes of deals, and we present some conditions on the deal for such a protocol to exist.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology — CRYPTO 1991, Proceedings
EditorsJoan Feigenbaum
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540551881
StatePublished - 1992
Externally publishedYes
Event11th Confrence on Advances in Cryptology, CRYPTO 1991 - Santa Barbara, United States
Duration: Aug 11 1991Aug 15 1991

Publication series

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


Other11th Confrence on Advances in Cryptology, CRYPTO 1991
Country/TerritoryUnited States
CitySanta Barbara

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Multiparty secret key exchange using a random deal of cards'. Together they form a unique fingerprint.

Cite this