Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cryptology

Bounds on Secret Key Exchange Using a Random Deal of Cards

Michael J. Fischer, Rebecca N. Wright

Published Jan 1, 1996• 57 citations
Publisher
DOI
10.1007/bf00190803

Related papers

Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures

Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi +1 more

Springer eBooks•Aug 28, 2007•1 citation

Multiparty Secret Key Exchange Using a Random Deal of Cards

Michael J. Fischer, Rebecca N. Wright

Springer eBooks•Aug 11, 2007•46 citations

Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (Extended Abstract)

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Lecture notes in computer science•Jan 1, 1999•10 citations

Secret Bit Transmission Using a Random Deal of Cards on Hierarchical Structures (Models of Computation and Algorithms)

玲奈 吉川, 善英 五十嵐

数理解析研究所講究録•Apr 1, 1999•0 citations

Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups

Takaaki Mizuki, Takao Nishizeki

Lecture notes in computer science•Jan 1, 2001•2 citations

An efficient protocol for unconditionally secure secret key exchange

Michael J. Fischer, Rebecca N. Wright

The multiparty secret key exchange problem is to find a k-player protocol for generating an n-bit random key. At the end of the protocol, the key should be known to each player but remain completely secret from a computationally unlimited eavesdropper, Eve, who overhears all communication among the players. The players are initially dealt hands of cards of prespecified sizes from a deck of distinct cards; any remaining cards are given to Eve. Considered here is the case in which each player receives the same fraction fi of the cards in the deck, for fi in the interval (0; 1=k]. The efficiency of a secret key exchange protocol is measured by the smallest deck size d 0 for which the protocol is guaranteed of success. A secret key exchange protocol is presented with d 0 = O(n(1=fi) 2:71 ). The best previous bound, by Fischer, Paterson, and Rackoff (1991), was super-polynomial in 1=fi and only handled the special case of k = 2 and n = 1. 1 Introduction The problem of multiparty secret ...

Symposium on Discrete Algorithms•Jan 1, 1993•19 citations
The multiparty secret key exchange problem is to find a k-player protocol for generating an n-bit random key. At the end of the protocol, the key should be known to each player but remain completely secret from a computationally unlimited eavesdropper, Eve, who overhears all communication among the players. The players are initially dealt hands of cards of prespecified sizes from a deck of distinct cards; any remaining cards are given to Eve. Considered here is the case in which each player receives the same fraction fi of the cards in the deck, for fi in the interval (0; 1=k]. The efficiency of a secret key exchange protocol is measured by the smallest deck size d 0 for which the protocol is guaranteed of success. A secret key exchange protocol is presented with d 0 = O(n(1=fi) 2:71 ). The best previous bound, by Fischer, Paterson, and Rackoff (1991), was super-polynomial in 1=fi and only handled the special case of k = 2 and n = 1. 1 Introduction The problem of multiparty secret ...