Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfect cryptographic security from partially independent channels
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Secure communications over insecure channels
Communications of the ACM
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
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
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Interaction in Key Distribution Schemes (Extended Abstract)
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Characterization of Optimal Key Set Protocols
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Fischer's cryptographic protocols
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Characterization of optimal key set protocols
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Private computation using a PEZ dispenser
Theoretical Computer Science
A secure and scalable group key exchange system
Information Processing Letters
A one-round secure message broadcasting protocol through a key sharing tree
Information Processing Letters
Verifying epistemic protocols under common knowledge
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Characterization of optimal key set protocols
Discrete Applied Mathematics
A secure and scalable Group Key Exchange system
Information Processing Letters
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 |
We consider the problem of multiparty secret key exchange. A "team" of players P1 through Pk wishes to determine an n-bit secret key in the presence of a computationally unlimited eavesdropper, Eve. The team players are dealt hands of cards of prespecified sizes from a deck of d distinct cards; any remaining cards are dealt to Eve. We explore how the team can use the information contained in their hands of cards to determine an n-bit key that is secret from Eve, that is, an n bit string which each team player knows exactly but for which Eve's probability of guessing the key correctly is 1/2n both before and after she hears the communication between the team players. We describe randomized protocols for secret key exchange that work for certain classes of deals, and we present some conditions on the deal for such a protocol to exist.