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

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)842-845
Number of pages4
JournalInformation Processing Letters
Issue number15
Publication statusPublished - 2009 Jul 16


  • Cryptography
  • Design of algorithms
  • Information-theoretic security
  • Key sharing graph
  • Multiparty secret key exchange

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'A one-round secure message broadcasting protocol through a key sharing tree'. Together they form a unique fingerprint.

Cite this