Construction of Secret Key Exchange Spanning Trees by Random Deals of Cards on Hierarchical Structures

摘要

We propose the problem of how to transmit and information-theoretically secure bit using random deals of cards among players in hierarchical groups and a computationally un- limited eavesdropper. A player in the highest group wants to send players in lower groups a secret bit which is secure from the eaves- dropper and some other players. We formalize this problem and design protocols for constructing secret key exchange spanning trees on hierarchical groups.