Characterization of optimal key set protocols

Takaaki Mizuki; Hiroki Shizuya; Takao Nishizeki

doi:10.1016/S0166-218X(02)00426-2

Characterization of optimal key set protocols

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Research and Development Divisions

Research output: Contribution to journal › Conference article › peer-review

8 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	213-236
Number of pages	24
Journal	Discrete Applied Mathematics
Volume	131
Issue number	1
DOIs	https://doi.org/10.1016/S0166-218X(02)00426-2
Publication status	Published - 2003 Sep 6
Event	2nd International Colloquium - Metz, France Duration: 2000 May 22 → 2000 May 24

Keywords

Card game
Key exchange graph
Key set protocol
Secret key exchange
Tree

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(02)00426-2

Fingerprint Dive into the research topics of 'Characterization of optimal key set protocols'. Together they form a unique fingerprint.

Cite this

@article{af5afdac8cc948dea498c443e400cb52,

title = "Characterization of optimal key set protocols",

abstract = "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.",

keywords = "Card game, Key exchange graph, Key set protocol, Secret key exchange, Tree",

author = "Takaaki Mizuki and Hiroki Shizuya and Takao Nishizeki",

year = "2003",

month = sep,

day = "6",

doi = "10.1016/S0166-218X(02)00426-2",

language = "English",

volume = "131",

pages = "213--236",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Characterization of optimal key set protocols

AU - Mizuki, Takaaki

AU - Shizuya, Hiroki

AU - Nishizeki, Takao

PY - 2003/9/6

Y1 - 2003/9/6

N2 - 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.

AB - 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.

KW - Card game

KW - Key exchange graph

KW - Key set protocol

KW - Secret key exchange

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=0042863252&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042863252&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(02)00426-2

DO - 10.1016/S0166-218X(02)00426-2

M3 - Conference article

AN - SCOPUS:0042863252

VL - 131

SP - 213

EP - 236

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1

T2 - 2nd International Colloquium

Y2 - 22 May 2000 through 24 May 2000

ER -