Skip to main content
Log in

A complete characterization of a family of key exchange protocols

  • Regular contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract.

Using a random deal of cards to players and a computationally 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 secret keys so that all these pairs form a tree over players. In this paper we obtain a necessary and sufficient condition on the number of cards for the existence of such a protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Published online: 29 January 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mizuki, T., Shizuya, H. & Nishizeki, T. A complete characterization of a family of key exchange protocols. IJIS 1, 131–142 (2002). https://doi.org/10.1007/s102070100011

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s102070100011

Navigation