Characterization of optimal key set protocols

Authors:
Takaaki Mizuki;Hiroki Shizuya;Takao Nishizeki
Affiliations:
Information Synergy Center, Tohoku University, Aoba-yama 05, Aoba-ku, Sendai 980-8579, Japan;Information Synergy Center, Tohoku University, Kawauchi, Aoba-ku, Sendai 980-8578, Japan;Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, Aoba-ku, Sendai, 980-8579, Japan
Venue:
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Year:
2003

Citing 4
Cited 1

An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
An efficient protocol for unconditionally secure secret key exchange

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multiparty Secret Key Exchange Using a Random Deal of Cards

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

A one-round secure message broadcasting protocol through a key sharing tree

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.