@inproceedings{638a27d6d55c4f8e8ba02ebe57983310,
title = "Characterization of optimal key set protocols (extended abstract)",
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 protocol. In this paper we give a necessary and suficient condition for a key set protocol to be \optimal,{"} that is, to succeed always in sharing a one-bit secret key.",
author = "Takaaki Mizuki and Hiroki Shizuya and Takao Nishizeki",
year = "2000",
doi = "10.1007/3-540-44929-9_21",
language = "English",
isbn = "3540678239",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "273--285",
editor = "{van Leeuwen}, Jan and Osamu Watanabe and Masami Hagiya and Mosses, {Peter D.} and Takayasu Ito",
booktitle = "Theoretical Computer Science",
address = "Germany",
note = " 1st IFIP International Conference on Theoretical Computer Science, TCS 2000 ; Conference date: 17-08-2000 Through 19-08-2000",
}