Key agreement for key hypergraph

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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
Volume26
Issue number7-8
DOIs
Publication statusPublished - 2007 Dec 1

Fingerprint

Group
secrecy

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Key agreement for key hypergraph. / Jeong, ik rae; Lee, Dong Hoon.

In: Computers and Security, Vol. 26, No. 7-8, 01.12.2007, p. 452-458.

Research output: Contribution to journalArticle

@article{ce9d1459e6574f0c90fb2f35cf81891a,
title = "Key agreement for key hypergraph",
abstract = "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.",
keywords = "Group key exchange, Insider attack, Key exchange, Key hypergraph, Randomness re-use",
author = "Jeong, {ik rae} and Lee, {Dong Hoon}",
year = "2007",
month = "12",
day = "1",
doi = "10.1016/j.cose.2007.08.001",
language = "English",
volume = "26",
pages = "452--458",
journal = "Computers and Security",
issn = "0167-4048",
publisher = "Elsevier Limited",
number = "7-8",

}

TY - JOUR

T1 - Key agreement for key hypergraph

AU - Jeong, ik rae

AU - Lee, Dong Hoon

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

KW - Group key exchange

KW - Insider attack

KW - Key exchange

KW - Key hypergraph

KW - Randomness re-use

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

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

U2 - 10.1016/j.cose.2007.08.001

DO - 10.1016/j.cose.2007.08.001

M3 - Article

VL - 26

SP - 452

EP - 458

JO - Computers and Security

JF - Computers and Security

SN - 0167-4048

IS - 7-8

ER -