An efficient protocol for unconditionally secure secret key exchange
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
| Hi-index | 0.00 |
Suppose that there are players in two hierarchical groups and a computationally unlimited eavesdropper. Using a random deal of cards, a player in the higher group wishes to send a one-bit message information-theoretically securely either to all the players in her group or to all the players in the two groups. This can be done by the socalled 2-level key set protocol. In this paper we give a necessary and sufficient condition for the 2-level key set protocol to succeed.