@inproceedings{04947d3fb17e4671b0a174dc5ce17846,
title = "Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key",
abstract = "Using a random deal of cards to players and a computation- ally 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 se- cret keys so that all these pairs form a spanning tree over players. In this paper we obtain a necessary and suficient condition on the number of cards for the existence of such a protocol. Our condition immediately yields an eficient linear-time algorithm to determine whether there exists a protocol to achieve such a secret key sharing.",
author = "Takaaki Mizuki and Hiroki Shizuya and Takao Nishizeki",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.; 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 ; Conference date: 02-05-1999 Through 06-05-1999",
year = "1999",
doi = "10.1007/3-540-48910-X_27",
language = "English",
isbn = "3540658890",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "389--401",
editor = "Jacques Stern",
booktitle = "Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",
}