Characterization of optimal key set protocols

Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocols. In this paper, we give a necessary and suf...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 131; no. 1; pp. 213 - 236
Main Authors:	Mizuki, Takaaki, Shizuya, Hiroki, Nishizeki, Takao
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Lausanne Elsevier B.V 06-09-2003 Amsterdam Elsevier New York, NY
Subjects:	Applied sciences Card game Combinatorics Combinatorics. Ordered structures Exact sciences and technology Game theory Graph theory Key exchange graph Key set protocol Mathematics Operational research and scientific management Operational research. Management science Sciences and techniques of general use Secret key exchange Tree Tree Card game Key set protocol Key exchange graph Secret key exchange Tree(graph) Network protocols Necessary and sufficient condition Graph theory Information Game theory Characterization Exchange Necessary condition Sufficient condition Sharing Secret key Key
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocols. In this paper, we give a necessary and sufficient condition for a key set protocol to be “optimal”, that is, to succeed always in sharing a one-bit secret key.
ISSN:	0166-218X 1872-6771
DOI:	10.1016/S0166-218X(02)00426-2