Key agreement for key hypergraph

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


In this paper, we propose a key agreement protocol for a key hypergraph. In a key hypergraph, a party is represented as a vertex and a group of parties is represented as a hyperedge. A key agreement protocol for a key hypergraph establishes all the keys for hyperedges in a key hypergraph at the same time. A naive approach would be to run a group key protocol concurrently for each hyperedge. By using the randomness re-use technique, we propose an efficient key agreement protocol for a key hypergraph, which is of two rounds. We formalize the key exchange model for a key hypergraph which is an extension of a group key exchange model and especially incorporates insider attacks. The proposed key agreement protocol for a key hypergraph provides key independence and forward secrecy in the random oracle model under the computational Diffie-Hellman assumption.

Original languageEnglish
Pages (from-to)452-458
Number of pages7
JournalComputers and Security
Issue number7-8
Publication statusPublished - 2007 Dec


  • Group key exchange
  • Insider attack
  • Key exchange
  • Key hypergraph
  • Randomness re-use

ASJC Scopus subject areas

  • Computer Science(all)
  • Law


Dive into the research topics of 'Key agreement for key hypergraph'. Together they form a unique fingerprint.

Cite this