Characterization of Optimal Key Set Protocols

Mizuki, Takaaki; Shizuya, Hiroki; Nishizeki, Takao

doi:10.1007/3-540-44929-9_21

Search citation statements

Order By: Relevance

Paper Sections

Select...

Key Set Protocol1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2001

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Asimple necessary and sufficient condition for $\gamma$ $\in W$ has been known $ [2,8]$ . Furthermore, acharacterization of "optimal" key set protocols is given in [7].…”

Section: Key Set Protocolmentioning

confidence: 99%

Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups

Mizuki

Nishizeki

2001

Algorithms and Computation

Self Cite

View full text Add to dashboard Cite

Suppose that there are players in two hierarchical groups and acomputationally unlimited eavesdropper. Using arandom deal of cards, aplayer in the higher group wishes to send aone-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 s0-called 2-level key set protocol. In this paper we give anecessary and sufficient condition for the 2-level key set protocol to succeed.

show abstract

“…Asimple necessary and sufficient condition for $\gamma$ $\in W$ has been known $ [2,8]$ . Furthermore, acharacterization of "optimal" key set protocols is given in [7].…”

Section: Key Set Protocolmentioning

confidence: 99%