Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(<特集>Special Issue on Selected Papers from LA Symposium)
スポンサーリンク
概要
- 論文の詳細を見る
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 so-called 2-level key set protocol. In this paper we give a necessary and sufficient condition for the 2-level key set protocol to succeed.
- 社団法人電子情報通信学会の論文
- 2002-02-01
著者
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
MIZUKI Takaaki
Information Synergy Center, Tohoku University
-
Mizuki Takaaki
Information Synergy Center Tohoku University
-
Mizuki Takaaki
Information Synergy Center Tohoku University:presto Jst
関連論文
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
- 平面グラフの格子短形描画
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
- Cost Total Colorings of Trees(Foundations of Computer Science)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
- LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
- Edge-Coloring Problems for Graphs
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- New Security Index for Digital Fingerprinting and Its Bounds
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- On the Average Length of Secret Key Exchange Eulerian Circuits(Special Section on Discrete Mathematics and Its Applications)
- One-Way Functions over Finite Near-Rings