TY - JOUR

T1 - A one-round secure message broadcasting protocol through a key sharing tree

AU - Mizuki, Takaaki

AU - Sato, Takuya

AU - Sone, Hideaki

N1 - Funding Information:
We thank the editor and the anonymous referees whose comments and suggestions helped us to improve the presentation of the paper. This work was supported by KAKENHI (19700002).

PY - 2009/7/16

Y1 - 2009/7/16

N2 - A key sharing graph is one in which each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players incident with the edge. Assume that, given a key sharing graph which contains a spanning tree, any designated player wishes to broadcast a message to all the other players securely against an eavesdropper. This can be easily done by flooding the message on the tree using the one-time pad scheme. However, the number of communication rounds in such a protocol is equal to the height of the tree. This paper provides another efficient protocol, which has exactly one communication round, i.e., we give a non-interactive protocol.

AB - A key sharing graph is one in which each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players incident with the edge. Assume that, given a key sharing graph which contains a spanning tree, any designated player wishes to broadcast a message to all the other players securely against an eavesdropper. This can be easily done by flooding the message on the tree using the one-time pad scheme. However, the number of communication rounds in such a protocol is equal to the height of the tree. This paper provides another efficient protocol, which has exactly one communication round, i.e., we give a non-interactive protocol.

KW - Cryptography

KW - Design of algorithms

KW - Information-theoretic security

KW - Key sharing graph

KW - Multiparty secret key exchange

UR - http://www.scopus.com/inward/record.url?scp=67349209928&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67349209928&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2009.04.004

DO - 10.1016/j.ipl.2009.04.004

M3 - Article

AN - SCOPUS:67349209928

VL - 109

SP - 842

EP - 845

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 15

ER -