Construction of Secret Key Exchange Spanning Trees by Random Deals of Cards on Hierarchical Structures (Special Section on Discrete Mathematics and Its Applications)

概要

論文の詳細を見る
We propose the problem of how to transmit an information-theoretically secure bit using random deals of cards among players in hierarchical groups and a computationally unlimited 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. For each protocol we give sufficient conditions to successfully construct a secret key exchange spanning tree for the hand sizes of the players and the eavesdropper.
社団法人電子情報通信学会の論文
2001-05-01