Characterization of optimal key set protocols

DOI10.1016/S0166-218X(02)00426-2zbMath1028.94024OpenAlexW2072652355MaRDI QIDQ1408828

Takaaki Mizuki, Takao Nishizeki, Hiroki Shuzuya

Publication date: 25 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00426-2

zbMATH Keywords

TreeCard gameKey exchange graphKey set protocolSecret key exchange

Mathematics Subject Classification ID

Trees (05C05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Six-Card Secure AND and Four-Card Secure XOR ⋮ A revised transformation protocol for unconditionally secure secret key exchange ⋮ A one-round secure message broadcasting protocol through a key sharing tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.
• Parallel concepts in graph theory
• Bounds on secret key exchange using a random deal of cards
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On Planar Graphical Degree Sequences

This page was built for publication: Characterization of optimal key set protocols