Abstract
We consider the problem of multiparty secret key exchange. A “team” of players P 1 through P k 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.
This research was supported in part by National Science Foundation grant IRI-9015570.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Beaver, S. Haber, and P. Winkler. On the Isolation of a Common Secret, preprint, Bellcore, 1991.
R. Beigel. 1991. (Private communication.)
E. R. Berlekamp, J. H. Conway, and R. K. Guy. Winning Ways, Volume I, Academic Press Inc., London, 1982.
W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Trans. Inform. Theory, IT-22, Vol. 6. Nov. 1976, pp. 644–654.
M. J. Fischer, M. S. Paterson, and C. Rackoff. Secret Bit Transmission Using a Random Deal of Cards, Distributed Computing and Cryptography, American Mathematical Society, 1991, pp. 173–181.
M. J. Fischer, P. Winkler, and R. N. Wright. June 1990. (Private communication.)
M. J. Fischer and R. N. Wright. Multiparty Secret Key Exchange Using a Random Deal of Cards, Technical Report YALEU/DCS/TR-855, Yale University, June 1991.
J. Flint. Cheating by Degrees, The Times Saturday Review, May 9, 1981.
R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-way Permutations, Proc. 21st ACM Symposium on Theory of Computing, May 1989, pp. 44–61.
U. M. Maurer. Perfect Cryptographic Security from Partially Independent Channels, Proc. 23rd ACM Symposium on Theory of Computing, May 1991, pp. 561–571.
R. C. Merkle. Secure Communication over Insecure Channels, Comm. ACM 21, 4, April 1978, pp. 294–299.
M. Rabin. Cryptography Without Secrets. Presented at DIMACS 1990 Workshop on Cryptography, Princeton, NJ. October 1–4, 1990.
P. Winkler. Cryptologic Techniques in Bidding and Defense, Parts I, II, III, and IV, Bridge Magazine, April–July, 1981.
P. Winkler. My Night at the Cryppie Club, Bridge Magazine, August 1981, pp. 60–63.
P. Winkler. The Advent of Cryptology in the Game of Bridge, Cryptologia, Vol. 7, No. 4, October 1983, pp. 327–332.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, M.J., Wright, R.N. (1992). Multiparty Secret Key Exchange Using a Random Deal of Cards. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive