Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

Authors:
Takaaki Mizuki;Hiroki Shizuya;Takao Nishizeki
Affiliations:
Nishizeki Lab., Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Education Center for Information Processing, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Venue:
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Year:
1999

Citing 3
Cited 7

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

Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Characterization of Optimal Key Set Protocols

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Characterization of optimal key set protocols

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A one-round secure message broadcasting protocol through a key sharing tree

Information Processing Letters
Characterization of optimal key set protocols

Discrete Applied Mathematics
Secure multiparty computations using the 15 puzzle

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

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 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 secret keys so that all these pairs form a spanning tree over players. In this paper we obtain a necessary and sufficient condition on the number of cards for the existence of such a protocol. Our condition immediately yields an efficient linear-time algorithm to determine whether there exists a protocol to achieve such a secret key sharing.